A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems

DOI10.1007/s10898-004-1952-zzbMath1093.90087MaRDI QIDQ2583182

Takahito Kuno

Publication date: 13 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-1952-z

zbMATH Keywords

Global optimization; Fractional programming; Nonconvex optimization; Branch-and-bound algorithm; Sum-of-ratios problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C26: Nonconvex programming, global optimization

90C32: Fractional programming

Related Items

A practicable branch and bound algorithm for sum of linear ratios problem, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, Global optimization for a class of nonlinear sum of ratios problem, An effective computational algorithm for the global solution of a class of linear fractional programming, A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension

Uses Software

• Octave

Cites Work

• 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
• An algorithm for generalized fractional programs
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• On some geometric optimization problems in layered manufacturing
• Image space analysis of generalized fractional programs
• A unified monotonic approach to generalized linear fractional programming
• Minimization of the sum of three linear fractional functions
• Solving the sum-of-ratios problem by an interior-point method
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
• Protecting critical facets in layered manufacturing.
• Monotonic Optimization: Problems and Solution Approaches
• Solving sum-of-ratios fractional programs using efficient points
• Fractional programming: The sum-of-ratios case
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems