We formulate a new optimization problem which arises in the Bank Asset and Liability Management (ALM). The problem is a fractionalprogramming which belongs to a class of global optimization. Most of optimization prob...
详细信息
We formulate a new optimization problem which arises in the Bank Asset and Liability Management (ALM). The problem is a fractionalprogramming which belongs to a class of global optimization. Most of optimization problems in the Bank Asset and Liability Management are return maximization or risk minimization problems. For solving the fractional programming problem, we propose curvilinear multi-start algorithm which finds the best local solutions to the problem. Numerical results are given based on the balance sheets of 5 commercial banks of Mongolia.
The paper presents the solution methodology of a multi-objective probabilistic fractional programming problem, where the parameters of the right hand side constraints follow Cauchy distribution. The proposed mathemati...
详细信息
The paper presents the solution methodology of a multi-objective probabilistic fractional programming problem, where the parameters of the right hand side constraints follow Cauchy distribution. The proposed mathematical model can not be solved directly. The solution procedure is completed in three steps. In first step, multi-objective probabilistic fractional programming problem is converted to deterministic multi-objective fractional mathematical programmingproblem. In the second step, it is converted to its equivalent multi-objective mathematical programmingproblem. Finally, epsilon-constraint method is applied to find the best compromise solution. A numerical example and application are presented to demonstrate the procedure of proposed mathematical model.
In this paper a method is proposed to solve fractional programming problem in which the functional relationship between the decision variables and the objective function is not completely known. Here we established th...
详细信息
In this paper a method is proposed to solve fractional programming problem in which the functional relationship between the decision variables and the objective function is not completely known. Here we established the crisp functional relationship between the objective function and the decision variables and solve the resulting programmingproblem to find a fair optimal solution to the original problem. An example is given in the last to illustrate the result.
In this paper, a nondifferentiable multiobjective fractional programming problem in which a support function appears in the numerator and denominator of each objective function as well as in each constraint function. ...
详细信息
ISBN:
(纸本)9788132224853;9788132224846
In this paper, a nondifferentiable multiobjective fractional programming problem in which a support function appears in the numerator and denominator of each objective function as well as in each constraint function. We propose Schaible type dual for a nondifferentiable second-order fractional programming problem. Next, we prove appropriate duality results using second-order (F, alpha, rho, d)-V-type-I convexity assumptions.
This paper proposes a metaheuristic approach called as Multi Objective Water Cycle Algorithm (MOWCA) for Fuzzy Multi Objective Non-Linear programmingproblem (FMONLPP). The suggested approach initially defines a fuzzy...
详细信息
ISBN:
(纸本)9781538628423
This paper proposes a metaheuristic approach called as Multi Objective Water Cycle Algorithm (MOWCA) for Fuzzy Multi Objective Non-Linear programmingproblem (FMONLPP). The suggested approach initially defines a fuzzy goal for each objective function with hyperbolic membership function. Further, the converted Fuzzy Multi-Objective Linear fractional programming problem (FMOLFPP) is changed into Fuzzy Multi Objective Non-Linear programmingproblem (MONLPP) and to find pareto solutions by the proposed metaheuristic approach. Generally, the efficiency of the metaheuristic algorithm is evaluated through various performance measures. In the present study, the following performance measures Generational Distance (GD), Reversed Generational Distance (RGD), Maximum spread (MS), Metric of spacing (S) and Delta Metric (Delta) are used to show the efficiency of the proposed algorithm. Finally, the comparative study is carried out with other existing metaheuristic approaches.
The assignment problem is one of the core combinatorial optimization problems in the optimization branch, and the theory and applications of fractionalprogramming have made great strides in recent years. Usually, the...
详细信息
The assignment problem is one of the core combinatorial optimization problems in the optimization branch, and the theory and applications of fractionalprogramming have made great strides in recent years. Usually, the possible coefficient values of linear fractionalprogramming and real-world problems are frequently only known to the decision in vague or uncertain terms. Hence, it would be more acceptable to interpret the coefficients for as fuzzy numerical information. In this paper, a fuzzy bi-objective fractional assignment (FBOFAP) has been formulated. A problem has been defined. Here, triangular shapes are used to indicate the parameters. The fuzzy problem is turned into a typical crisp problem through alpha-cut using a fuzzy number and then the compromise solution is generated by fuzzy programming.
This study contributes valuable insights into linear fractional transshipment problem which is a special class of mathematical programmingproblem. We present the mathematical model for the linear fractional transship...
详细信息
This study contributes valuable insights into linear fractional transshipment problem which is a special class of mathematical programmingproblem. We present the mathematical model for the linear fractional transshipment problem and develop an efficient algorithm based on the 'Avoid Maximum Cost Method (AMCM)' for finding an initial basic feasible solution (IBFS) of the given model. AMCM is based on the concept of making the maximum possible allocation to either a column or a row of the transportation cost matrix in such a way that the allocation to the corresponding cell that has the highest cost will be avoided in the further steps. The methodology is composed of the following two steps: firstly, we formulated an equivalent transportation model of the problem by considering the cost-profit ratio matrix. Secondly, we apply AMCM to find an IBFS of the problem. In a nutshell, this article finds the solution to a linear fractional transshipment model by applying AMCM to the cost-profit ratio matrix. The applicability of the proposed approach is illustrated with some suitable numerical examples. The contribution ends by introducing a comparative analysis to show the efficiency of the proposed algorithm.
In this paper, we present some Farkas-type results for a fractional programming problem. To this end, by using the properties of dualizing parametrization functions, Lagrangian functions and the epigraph of the conjug...
详细信息
In this paper, we present some Farkas-type results for a fractional programming problem. To this end, by using the properties of dualizing parametrization functions, Lagrangian functions and the epigraph of the conjugate functions, we introduce some new notions of regularity conditions and then obtain some dual forms of Farkas-type results for this fractional programming problem. We also obtain sufficient conditions for alternative type theorems. As an application of these results, we obtain the corresponding results for a convex optimization problem.
This paper addresses a general multi-objective fractional programming problem whose parameters in the objective functions and constraints are intervals. Existence of the efficient solution of this model is studied. A ...
详细信息
This paper addresses a general multi-objective fractional programming problem whose parameters in the objective functions and constraints are intervals. Existence of the efficient solution of this model is studied. A methodology is developed to determine its efficient solutions. This methodology is illustrated through a numerical example.
The rapid development of wireless communication comes at the cost of dramatically increasing energy consumption, which makes the optimisation of energy efficiency (EE) extremely important. In this study, the authors f...
详细信息
The rapid development of wireless communication comes at the cost of dramatically increasing energy consumption, which makes the optimisation of energy efficiency (EE) extremely important. In this study, the authors focus on maximising EE of large-scale multiple-input-multiple-output system by optimising the transmit power and the number of selected base station antennas. First, the EE optimisation problem, i.e. finding the optimal EE-based values of each parameter, when the other one is fixed, is investigated. Then, the optimisation problem jointly considering these two parameters to maximise EE is studied. Moreover, the EE optimisation problem is extended to multi-user (MU) system. Owing to the formulation of EE, the EE optimisation problem is reformulated as the fractional programming problem, and the Dinkelbach method is proposed to deal with this problem instead of the binary search algorithm (BSA) by switching the objective function to a weighted sum of rate and power. Simulation results show that the EE can be improved with the proposed Dinkelbach method, and it has a faster convergence speed than the BSA without any performance loss for both single-user system and MU system.
暂无评论