1. Interval division and linearization algorithm for minimax linear fractional program.
- Author
-
Zhang, Bo, Gao, Yuelin, Liu, Xia, and Huang, Xiaoli
- Subjects
- *
FRACTIONAL programming , *POLYNOMIAL time algorithms , *ALGORITHMS , *POLYNOMIAL approximation , *OUTER space , *PARALLEL algorithms , *APPROXIMATION algorithms - Abstract
This paper constructs an interval partition linearization algorithm for solving minimax linear fractional programming (MLFP) problem. In this algorithm, MLFP is converted and decomposed into a series of linear programs by dividing the outer 1-dimensional space of the equivalent problem (EP) into polynomially countable intervals. To improve the computational efficiency of the algorithm, two new acceleration techniques are introduced, in which the regions in outer space where the optimal solution of EP does not exist are largely deleted. In addition, the global convergence of the proposed algorithm is summarized, and its computational complexity is illustrated to reveal that it is a fully polynomial time approximation scheme. Finally, the numerical results demonstrate that the proposed algorithm is feasible and effective. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF