Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs

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, com...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 146; no. 1; pp. 1 - 18
Main Author:	Benson, H. P.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.07.2010 Springer Springer Nature B.V
Subjects:	Algorithms Applications of Mathematics Applied sciences Approximation Bond portfolios Branch & bound algorithms Calculus of Variations and Optimal Control; Optimization Computation Engineering Equivalence Exact sciences and technology Mathematical analysis Mathematical models Mathematical programming Mathematics Mathematics and Statistics Operational research and scientific management Operational research. Management science Operations management Operations Research/Decision Theory Optimization Programming Ratios Studies Theory of Computation Global optimization Fractional programming Outer approximation Branch and bound Sum of ratios Convex set Compact space Linear form Branch and bound method Minimization Global optimum Approximation algorithm Modeling Convex programming Exact solution Rational function Quadratic function Mathematical programming
ISSN:	0022-3239, 1573-2878
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!