A practicable branch and bound algorithm for sum of linear ratios problem

@article{Jiao2015APB,
title={A practicable branch and bound algorithm for sum of linear ratios problem},
author={Hong-Wei Jiao and San-Yang Liu},
journal={European Journal of Operational Research},
year={2015},
volume={243},
pages={723-730}
}

This article presents a practicable algorithm for globally solving sum of linear ratios problem (SLR). The algorithm works by globally solving a bilinear programming problem (EQ) that is equivalent to the problem (SLR). In the algorithm, by utilizing convex envelope and concave envelope of bilinear function, the initial nonconvex programming problem is reduced to a sequence of linear relaxation programming problems. In order to improve the computational efficiency of the algorithm, a new… CONTINUE READING