Author： Benson H.
Publisher： Springer Publishing Company
ISSN： 0022-3239
Source： Journal of Optimization Theory and Applications, Vol.146, Iss.1, 2010-07, pp. : 1-18
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this article, a branch and-bound outer approximation algorithm is presented for globally solving a sum-of-ratios fractional programming problem. To solve this problem, the algorithm instead solves an equivalent problem that involves minimizing an indefinite quadratic function over a nonempty, compact convex set. This problem is globally solved by a branch-and-bound outer approximation approach that can create several closed-form linear inequality cuts per iteration. In contrast to pure outer approximation techniques, the algorithm does not require computing the new vertices that are created as these cuts are added. Computationally, the main work of the algorithm involves solving a sequence of convex programming problems whose feasible regions are identical to one another except for certain linear constraints. As a result, to solve these problems, an optimal solution to one problem can potentially be used to good effect as a starting solution for the next problem.
Related content
Fractional programming: the sum-of-ratios case
By Schaible Siegfried Shi Jianming
Optimization Methods and Software, Vol. 18, Iss. 2, 2003-04 ,pp. :
Access to resources
Recommend
