A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
DOI10.1007/s11075-022-01471-zOpenAlexW4313257262MaRDI QIDQ6098133
Shen Peiping, Wu Dianxiao, Wang Yafei
Publication date: 12 June 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01471-z
convergence analysisglobal optimizationbranch and boundsecond-order cone approximationssum of linear ratios problem
Nonlinear programming (90C30) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical analysis (65-XX)
Cites Work
- Network data envelopment analysis: a review
- A practicable branch and bound algorithm for sum of linear ratios problem
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Image space analysis of generalized fractional programs
- Minimization of the sum of three linear fractional functions
- Solving the sum-of-ratios problem by an interior-point method
- Range division and linearization algorithm for a class of linear ratios optimization problems
- An interior-point method for generalized linear-fractional programming
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- Integrated data envelopment analysis: global vs. local optimum
- Mathematical optimization ideas for biodiversity conservation
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- On Maximizing a Sum of Ratios
- Duality in Fractional Programming: A Unified Approach
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Downside Risk Approach for Multi-Objective Portfolio Optimization
- Programming with linear fractional functionals
- Unnamed Item
- Unnamed Item
This page was built for publication: A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
