A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems
Journal of Global Optimization
Global optimization for sum of generalized fractional functions
Journal of Computational and Applied Mathematics
Global optimization for a class of fractional programming problems
Journal of Global Optimization
MAPEL: achieving global optimality for a non-convex wireless power control problem
IEEE Transactions on Wireless Communications
Manifold block optimization method by utilizing evolution algorithm
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Solving the sum-of-ratios problems by a harmony search algorithm
Journal of Computational and Applied Mathematics
S-MAPEL: monotonic optimization for non-convex joint power control and scheduling problems
IEEE Transactions on Wireless Communications
A numerical study on B&B algorithms for solving sum-of-ratios problem
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
A new linearization method for generalized linear multiplicative programming
Computers and Operations Research
| Hi-index | 0.00 |
We present an efficient unified method for solving a wide class of generalized linear fractional programming problems. This class includes such problems as: optimizing (minimizing or maximizing) a pointwise maximum or pointwise minimum of a finite number of ratios of linear functions, optimizing a sum or product of such ratios, etc. – over a polytope. Our approach is based on the recently developed theory of monotonic optimization.