On the global optimization of sums of linear fractional functions over a convex set

DOI10.1023/B:JOTA.0000026129.07165.5azbMath1140.90473MaRDI QIDQ704748

Harold P. Benson

Publication date: 19 January 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

concave minimizationparametric programmingGlobal optimizationsum of ratioslinear fractional functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)

Related Items

Global solutions to fractional programming problem with ratio of nonconvex functions, A review of recent advances in global optimization, A practicable branch and bound algorithm for sum of linear ratios problem, An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints, Global optimization of generalized linear fractional programming with nonlinear constraints, Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, A new deterministic global computing algorithm for solving a kind of linear fractional programming, Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems, A global optimization algorithm for sum of quadratic ratios problem with coefficients, An effective computational algorithm for the global solution of a class of linear fractional programming, Solving sum of ratios fractional programs via concave minimization, Global optimization for sum of generalized fractional functions, A deterministic method for solving the sum of linear ratios problem, An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels, Global optimization for sum of linear ratios problem with coefficients, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, An effective algorithm for globally solving sum of linear ratios problems, Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming, Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems, Solving the sum-of-ratios problem by a stochastic search algorithm, Solving sum of quadratic ratios fractional programs via monotonic function, Global optimization for a class of fractional programming problems, The attractive traveling salesman problem, A sixth bibliography of fractional programming, Global optimization for the sum of concave-convex ratios problem, Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating sum-of-ratios test problems in global optimization
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Global minimization of a generalized convex multiplicative function
• Image space analysis of generalized fractional programs
• Primal-relaxed dual global optimization approach
• Handbook of global optimization
• Minimization of the sum of three linear fractional functions
• A global optimization algorithm for linear fractional and bilinear programs
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• Decomposition approach for the global minimization of biconcave functions over polytopes
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• On Maximizing a Sum of Ratios
• An algorithm for nonconvex programming problems
• A note on the sum of a linear and linear-fractional function
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Programming with linear fractional functionals
• Convex Analysis
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems