A branch and bound algorithm to globally solve the sum of several linear ratios
From MaRDI portal
Publication:2572656
DOI10.1016/j.amc.2004.08.016zbMath1079.65071OpenAlexW2040181397MaRDI QIDQ2572656
Zhi-An Liang, Pei-Ping Shen, Yan-Jun Wang
Publication date: 4 November 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.08.016
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)
Related Items
A review of recent advances in global optimization, A practicable branch and bound algorithm for sum of linear ratios problem, A reduced space branch and bound algorithm for a class of sum of ratios problems, Outcome space range reduction method for global optimization of sum of affine ratios problem, Global optimization of generalized linear fractional programming with nonlinear constraints, Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems, A global optimization algorithm for sum of linear ratios problem, An accelerating outer space algorithm for globally solving generalized linear multiplicative problems, A potential practical algorithm for minimizing the sum of affine fractional functions, Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models, A new accelerating method for globally solving a class of nonconvex programming problems, Range division and compression algorithm for quadratically constrained sum of quadratic ratios, Integrated data envelopment analysis: linear vs. nonlinear model, An effective algorithm for globally solving sum of linear ratios problems, A branch and bound algorithm for globally solving a class of nonconvex programming problems, A geometric branch and bound method for robust maximization of convex functions, Global optimization for sum of linear ratios problem using new pruning technique, Inner approximation algorithm for generalized linear multiplicative programming problems, A parametric solution method for a generalized fractional programming problem
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
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Global minimization of a generalized convex multiplicative function
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Minimization of the sum of three linear fractional functions
- Programming with linear fractional functionals
