An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem

DOI10.1007/s11590-010-0232-8zbMath1259.90133OpenAlexW2049924821MaRDI QIDQ691453

Jianming Shi, Lianbo Gao, Shashi Kant Mishra

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0232-8

zbMATH Keywords

branch-and-bound approach\({\mathcal{NP}}\)-hardsum-of-linear (nonlinear)-ratios problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (6)

A practicable branch and bound algorithm for sum of linear ratios problem ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ An exact method for solving the integer sum of linear ratios problem ⋮ A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension ⋮ Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Cites Work

• Unnamed Item
• 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
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Global optimization of 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
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Conical partition algorithm for maximizing the sum of dc ratios
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
• \(NP\)-hardness of linear multiplicative programming and related problems
• Solving sum-of-ratios fractional programs using efficient points
• Fractional programming: The sum-of-ratios case
• A note on the sum of a linear and linear-fractional function
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A combined algorithm for fractional programming

This page was built for publication: An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem