Global algorithm for effectively solving min-max affine fractional programs

DOI10.1007/s12190-024-02027-1zbMATH Open1542.90233MaRDI QIDQ6584742

Hong-Wei Jiao, Yudong Sun, Wenjie Wang, You-lin Shang

Publication date: 8 August 2024

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmic complexitylinear relaxation techniquebranch-relaxation-bound algorithmmin-max affine fractional programs

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving long-term financial planning problems via global optimization
• A unified monotonic approach to generalized linear fractional programming
• A hybrid LP/NLP paradigm for global optimization relaxations
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• An interior-point method for fractional programs with convex constraints
• Generalized fractional programming and cutting plane algorithms
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
• An effective branch and bound algorithm for minimax linear fractional programming
• Effective algorithm and computational complexity for solving sum of linear ratios problem
• A new linearization technique for minimax linear fractional programming
• Lower subdifferentiability in minimax fractional programming^*
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• A DC approach for minimax fractional optimization programs with ratios of convex functions
• A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints
• On Minimax Fractional Semi-Infinite Programming Problems with Applications
• Two-level linear relaxation method for generalized linear fractional programming
• Efficient algorithm for globally computing the min–max linear fractional programming problem
• A potential practical algorithm for minimizing the sum of affine fractional functions
• Interval division and linearization algorithm for minimax linear fractional program
• An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems

This page was built for publication: Global algorithm for effectively solving min-max affine fractional programs