Global optimization algorithm for the nonlinear sum of ratios problem

DOI10.1023/A:1013072027218zbMath1049.90062OpenAlexW2014833368MaRDI QIDQ5959898

Harold P. Benson

Publication date: 11 April 2002

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

Full work available at URL: https://doi.org/10.1023/a:1013072027218

zbMATH Keywords

fractional programmingbranch-and-bound algorithms

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (39)

Minimizing the sum of many rational functions ⋮ Global solutions to fractional programming problem with ratio of nonconvex functions ⋮ 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 ⋮ Maximizing for the sum of ratios of two convex functions over a convex set ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ A branch-bound cut technique for non-linear fractional multi-objective optimization problems ⋮ Minimization of isotonic functions composed of Fractions ⋮ Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm ⋮ On solving the sum-of-ratios problem ⋮ A practical but rigorous approach to sum-of-ratios optimization in geometric applications ⋮ An exact method for solving the integer sum of linear ratios problem ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ A global optimization algorithm for sum of quadratic ratios problem with coefficients ⋮ Using conical partition to globally maximizing the nonlinear sum of ratios ⋮ Global optimization for a class of nonlinear sum of ratios problem ⋮ Global optimization for the sum of generalized polynomial fractional functions ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ Efficient local search procedures for quadratic fractional programming problems ⋮ Solving fractional problems with dynamic multistart improving hit-and-run ⋮ A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem ⋮ Solving the sum-of-ratios problems by a harmony search algorithm ⋮ Global optimization of nonlinear sum of ratios problem ⋮ Global optimization for the generalized polynomial sum of ratios problem ⋮ Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs ⋮ Global optimization for sum of geometric fractional functions ⋮ Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem ⋮ Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming ⋮ A global optimization approach to fractional optimal control ⋮ A doubly nonnegative relaxation for modularity density maximization ⋮ Fractional programming approach to a cost minimization problem in electricity market ⋮ Solving the sum-of-ratios problem by a stochastic search algorithm ⋮ Solving sum of quadratic ratios fractional programs via monotonic function ⋮ A parametric solution method for a generalized fractional programming problem ⋮ Global optimization for a class of fractional programming problems ⋮ A sixth bibliography of fractional programming ⋮ Global optimization for the sum of concave-convex ratios problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• Minimization of the sum of three linear fractional functions
• Solving the sum-of-ratios problem by an interior-point method
• A global optimization algorithm for linear fractional and bilinear programs
• On the continuity of the minimum set of a continuous function
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• On Maximizing a Sum of Ratios
• 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
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems

This page was built for publication: Global optimization algorithm for the nonlinear sum of ratios problem