A global optimization algorithm for sum of linear ratios problem
From MaRDI portal
Publication:364313
DOI10.1155/2013/276245zbMath1271.90046OpenAlexW2042046882WikidataQ59002542 ScholiaQ59002542MaRDI QIDQ364313
Publication date: 9 September 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/276245
Related Items (8)
Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
Cites Work
- Global optimization for sum of linear ratios problem using new pruning technique
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Minimization of the sum of three linear fractional functions
- A global optimization algorithm for linear fractional programming
- Solving sum of ratios fractional programs via concave minimization
- 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
- Introduction to global optimization.
This page was built for publication: A global optimization algorithm for sum of linear ratios problem
