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

DOI10.1007/S10898-004-1952-ZMaRDI QIDQ2583182zbMATH OpenOpenAlexFDO

Authors 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

Branch-and-bound algorithmFractional programmingGlobal optimizationNonconvex optimizationSum-of-ratios problem

Mathematics Subject Classification ID

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

Recommendations

• Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• A numerical study on B\&B algorithms for solving sum-of-ratios problem
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• A new global algorithm for the sum of linear ratios problem

Cites work

• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• A unified monotonic approach to generalized linear fractional programming
• An algorithm for generalized fractional programs
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
• Fractional programming: The sum-of-ratios case
• scientific article; zbMATH DE number 1342815 (Why is no real title available?)
• Image space analysis of generalized fractional programs
• Minimization of the sum of three linear fractional functions
• Monotonic optimization: Problems and solution approaches
• On some geometric optimization problems in layered manufacturing
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Protecting critical facets in layered manufacturing.
• Solving sum-of-ratios fractional programs using efficient points
• Solving the sum-of-ratios problem by an interior-point method
• Using concave envelopes to globally solve the nonlinear sum of ratios problem

Cited in

(13)

• Global optimization for a class of nonlinear sum of ratios problem
• Lower tolerance-based branch and bound algorithms for the ATSP
• 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
• A practicable branch and bound algorithm for sum of linear ratios problem
• A potential practical algorithm for minimizing the sum of affine fractional functions
• (Global) optimization: historical notes and recent developments
• A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
• Reduced outer space algorithm for globally computing affine sum-of-ratios problems
• Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
• An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs
• Global branch-reduction-bound algorithm to tackle the sum of the general affine ratios programming
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem

Describes a project that uses

Uses Software

• Octave

This page was built for publication: A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583182)