An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
From MaRDI portal
Publication:6077941
DOI10.1142/s0217595922500105zbMath1528.90286OpenAlexW4221057869WikidataQ113343358 ScholiaQ113343358MaRDI QIDQ6077941
Publication date: 19 October 2023
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595922500105
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Network data envelopment analysis: a review
- A practicable branch and bound algorithm for sum of linear ratios problem
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- On the global optimization of sums of linear fractional functions over a convex set
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Image space analysis of generalized fractional programs
- A unified monotonic approach to generalized linear fractional programming
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Minimization of the sum of three linear fractional functions
- 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
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- \(NP\)-hardness of linear multiplicative programming and related problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- 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