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

DOI10.1007/S11590-010-0232-8zbMATH Open1259.90133OpenAlexW2049924821MaRDI QIDQ691453FDOQ691453

Authors: Lianbo Gao, Jianming Shi, S. K. 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

Recommendations

• scientific article; zbMATH DE number 6178192
• An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• An output-space branch-and-bound algorithm for finding the global solution of the sum-of-linear-ratios problem
• A practicable branch and bound algorithm for sum of linear ratios problem
• A branch and bound algorithm to globally solve the sum of several linear ratios
• scientific article; zbMATH DE number 7267293
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• A branch and bound algorithm for a class of non-convex programming problems
• A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem

zbMATH Keywords

\({\mathcal{NP}}\)-hardbranch-and-bound approachsum-of-linear (nonlinear)-ratios problem

Mathematics Subject Classification ID

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

Cites Work

• Solving the sum-of-ratios problem by an interior-point method
• Fractional programming: The sum-of-ratios case
• 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
• Title not available (Why is that?)
• Global optimization of fractional programs
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• \(NP\)-hardness of linear multiplicative programming and related problems
• A unified monotonic approach to generalized linear fractional programming
• 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
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Minimization of the sum of three linear fractional functions
• Conical partition algorithm for maximizing the sum of dc ratios
• Title not available (Why is that?)
• Solving sum-of-ratios fractional programs using efficient points
• Title not available (Why is that?)
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
• A combined algorithm for fractional programming

Cited In (12)

• A note on the paper ``Global optimization of nonlinear sum of ratios
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
• Title not available (Why is that?)
• A numerical study on B\&B algorithms for solving sum-of-ratios problem
• A practicable branch and bound algorithm for sum of linear ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem
• Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
• An exact method for solving the integer sum of linear ratios problem
• Solving the sum-of-ratios problems by a harmony search algorithm
• Title not available (Why is that?)

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

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