scholarly journals Solving a fractional programming problem in a commercial bank

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Ankhbayar Chuluunbaatar ◽  
Enkhbat Rentsen

<p style='text-indent:20px;'>We formulate a new optimization problem which arises in the Bank Asset and Liability Management (ALM). The problem is a fractional programming 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.</p>

2019 ◽  
Vol 53 (4) ◽  
pp. 1229-1244
Author(s):  
Bogdana Stanojević ◽  
Milan Stanojević

The main contribution of this paper is the procedure that constructs a good approximation to the non-dominated set of multiple objective linear fractional programming problem using the solutions to certain linear optimization problems. In our approach we propose a way to generate a discrete set of feasible solutions that are further used as starting points in any procedure for deriving efficient solutions. The efficient solutions are mapped into non-dominated points that form a 0th order approximation of the Pareto front. We report the computational results obtained by solving random generated instances, and show that the approximations obtained by running our procedure are better than those obtained by running other procedures suggested in the recent literature. We evaluated the quality of each approximation using classic metrics.


Author(s):  
Rasha Jalal

The aim of this paper is to suggest a solution procedure to fractional programming problem based on new ranking function (RF) with triangular fuzzy number (TFN) based on alpha cuts sets of fuzzy numbers. In the present procedure the linear fractional programming (LFP) problems is converted into linear programming problems. We concentrate on linear programming problem problems in which the coefficients of objective function are fuzzy numbers, the right- hand side are fuzzy numbers too, then solving these linear programming problems by using a new ranking function. The obtained linear programming problem can be solved using win QSB program (simplex method) which yields an optimal solution of the linear fractional programming problem. Illustrated examples and comparisons with previous approaches are included to evince the feasibility of the proposed approach.


Author(s):  
S. Chandra ◽  
B. D. Craven ◽  
B. Mond

AbstractA ratio game approach to the generalized fractional programming problem is presented and duality relations established. This approach suggests certain solution procedures for solving fractional programs involving several ratios in the objective function.


Sign in / Sign up

Export Citation Format

Share Document