Global optimization for sum of linear ratios problem using new pruning technique
From MaRDI portal
Publication:1023182
DOI10.1155/2008/646205zbMath1173.90543OpenAlexW2143775017WikidataQ58646230 ScholiaQ58646230MaRDI QIDQ1023182
Pei-Ping Shen, Qigao Feng, Yunrui Guo, Hong-Wei Jiao
Publication date: 11 June 2009
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55987
Related Items
A global optimization algorithm for sum of linear ratios problem ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming
Cites Work
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Global optimization of generalized linear fractional programming with nonlinear constraints
- A deterministic global optimization algorithm
- A note on a deterministic global optimization algorithm
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- A unified monotonic approach to generalized linear fractional programming
- Global optimization for sum of linear ratios problem with coefficients
- A branch and bound algorithm to globally solve the sum of several linear ratios
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
