This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming problem is then established by utilizing convexity and concavity of functions in the problem. Other than usual branch and bound algorithm, an adapted partition skill and a practical reduction technique performed only in an unidimensional interval are incorporated into the algorithm scheme to significantly improve the computational performance. The global convergence is proved. Finally, some comparative experiments and a randomized numerical test are carried out to demonstrate the efficiency and robustness of the proposed algorithm.
@article{bwmeta1.element.doi-10_1515_math-2017-0072,
author = {Yingfeng Zhao and Sanyang Liu and Hongwei Jiao},
title = {A new branch and bound algorithm for minimax ratios problems},
journal = {Open Mathematics},
volume = {15},
year = {2017},
pages = {840-851},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2017-0072}
}
Yingfeng Zhao; Sanyang Liu; Hongwei Jiao. A new branch and bound algorithm for minimax ratios problems. Open Mathematics, Tome 15 (2017) pp. 840-851. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2017-0072/