Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs

DOI10.1007/s10957-010-9647-8zbMath1206.90188OpenAlexW2088951714MaRDI QIDQ711696

Harold P. Benson

Publication date: 27 October 2010

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

Full work available at URL: https://doi.org/10.1007/s10957-010-9647-8

zbMATH Keywords

global optimizationbranch and boundouter approximationfractional programmingsum of ratios

Mathematics Subject Classification ID

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

Related Items

A practicable branch and bound algorithm for sum of linear ratios problem, A branch-bound cut technique for non-linear fractional multi-objective optimization problems, 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, A new deterministic global computing algorithm for solving a kind of linear fractional programming, Effective algorithm and computational complexity for solving sum of linear ratios problem, Range division and linearization algorithm for a class of linear ratios optimization problems, An effective computational algorithm for the global solution of a class of linear fractional programming, Global optimization for a class of nonlinear sum of ratios problem, An outcome space algorithm for minimizing a class of linear ratio optimization problems, Integrated data envelopment analysis: linear vs. nonlinear model, Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, A parametric solution method for a generalized fractional programming problem

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• Using concave envelopes to globally solve the nonlinear sum of ratios problem
• On the global optimization of sums of linear fractional functions over a convex set
• 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
• A unified monotonic approach to generalized linear fractional programming
• Solving the sum-of-ratios problem by an interior-point method
• Solving sum-of-ratios fractional programs using efficient points
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• On Maximizing a Sum of Ratios
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• The Supporting Hyperplane Method for Unimodal Programming
• Cluster Analysis and Mathematical Programming
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• Global optimization of nonlinear sums of ratios
• Global optimization algorithm for the nonlinear sum of ratios problem