# fractional programming problemRecently Published Documents

194
(FIVE YEARS 62)

## H-INDEX

13
(FIVE YEARS 3)

Author(s):
Hamiden Abd El- Wahed Khalifa ◽
Pavan Kumar

2022 ◽
Vol 13 (1) ◽
pp. 0-0

This paper presents an application of Water Cycle algorithm (WCA) in solving stochastic programming problems. In particular, Linear stochastic fractional programming problems are considered which are solved by WCA and solutions are compared with Particle Swarm Optimization, Differential Evolution, and Whale Optimization Algorithm and the results from literature. The constraints are handled by converting constrained optimization problem into an unconstrained optimization problem using Augmented Lagrangian Method. Further, a fractional stochastic transportation problem is examined as an application of the stochastic fractional programming problem. In terms of efficiency of algorithms and the ability to find optimal solutions, WCA gives highly significant results in comparison with the other metaheuristic algorithms and the quoted results in the literature which demonstrates that WCA algorithm has 100% convergence in all the problems. Moreover, non-parametric hypothesis tests are performed and which indicates that WCA presents better results as compare to the other algorithms.

2022 ◽
Vol 13 (1) ◽
pp. 0-0

This paper presents an application of Water Cycle algorithm (WCA) in solving stochastic programming problems. In particular, Linear stochastic fractional programming problems are considered which are solved by WCA and solutions are compared with Particle Swarm Optimization, Differential Evolution, and Whale Optimization Algorithm and the results from literature. The constraints are handled by converting constrained optimization problem into an unconstrained optimization problem using Augmented Lagrangian Method. Further, a fractional stochastic transportation problem is examined as an application of the stochastic fractional programming problem. In terms of efficiency of algorithms and the ability to find optimal solutions, WCA gives highly significant results in comparison with the other metaheuristic algorithms and the quoted results in the literature which demonstrates that WCA algorithm has 100% convergence in all the problems. Moreover, non-parametric hypothesis tests are performed and which indicates that WCA presents better results as compare to the other algorithms.

2021 ◽
pp. 1051-1064
Author(s):
Rebaz Mustafa ◽

In this paper, we have proposed a new technique to find an efficient solution to fractional programming problems (FPP). The multi-objective fractional programming problem (MOFPP) is converted into multi-objective linear programming (MOLPP) utilizing the point-slopes formula for a plane, which has equivalent weights to the MOFPP. The MOLPP is diminished to a single objective linear programming problem (SOLPP) through using two new techniques for the values of the objective function and suggesting an algorithm for its solution. Finally, we obtained the optimal solution for MOFPP by solving the consequent linear programming problem (LPP). The proposed practicability is confirmed with the existing approaches, with some numerical examples and we indicated comparison with other techniques.

2021 ◽
pp. 817-825
Author(s):
Ganesan Kandasamy ◽
T. Loganathan

In this study, we present a novel method for solving fully fuzzy multi-objective linear fractional programming problems without transforming to equivalent crisp problems. First, we calculate the fuzzy optimal value for each fractional objective function and then we convert the fully fuzzy multi-objective linear fractional programming problem to a single objective fuzzy linear fractional programming problem and ﬁnd its fuzzy optimal solution which inturn yields a fuzzy Pareto optimal solution for the given fully fuzzy multi-objective linear fractional programming problem. To demonstrate the proposed strategy, a numerical example is provided.

2021 ◽
pp. 100091
Author(s):
D. Sahoo ◽
A.K. Tripathy ◽
J.K. Pati

2021 ◽
Vol 2021 ◽
pp. 1-10
Author(s):
Pujun Jia ◽
Hongwei Jiao ◽
Dongwei Shi ◽
Jingben Yin

This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, management optimization, and so on. In this algorithm, by introducing auxiliary variables, we first equivalently transform the problem (MLFP) into the problem (EP). By using a new linear relaxation technique, the problem (EP) is reduced to a sequence of linear relaxation problems over the outer space rectangle, which provides the valid lower bound for the optimal value of the problem (EP). Based on the outer space branch-and-bound search and the linear relaxation problem, an outer space branch-and-bound algorithm is constructed for globally solving the problem (MLFP). In addition, the convergence and complexity of the presented algorithm are given. Finally, numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.

2021 ◽
pp. 1-28
Author(s):
Tran Van Su ◽
Dinh Dieu Hang

Author(s):
YongJin Kim ◽
YunChol Jong ◽
JinWon Yu

2021 ◽
pp. 427-433
Author(s):
Mansour Saraj ◽
Some efficient interior-point methods (IPMs) are based on using a self-concordant barrier function related to the feasibility set of the underlying problem.Here, we use IPMs for solving fractional programming problems involving second order cone constraints. We propose a logarithmic barrier function to show the self concordant property and present an algorithm to compute $\varepsilon-$solution of a fractional programming problem. Finally, we provide a numerical example to illustrate the approach.