Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems

DOI10.1016/J.CAM.2025.116874MaRDI QIDQ6926925zbMATH OpenFDO

Authors Hong-Wei Jiao, Wenjie Wang, Youlin Shang

Publication date 23 September 2025

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

Full work available at URL https://doi.org/10.1016/J.CAM.2025.116874

zbMATH Keywords

computational complexitylinear relaxation problemlinear relaxation techniquemin-max affine fractional programoutcome-space-based branch-and-bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Cites work

• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• A eighth bibliography of fractional programming
• A hybrid LP/NLP paradigm for global optimization relaxations
• A new linearization technique for minimax linear fractional programming
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations
• A unified monotonic approach to generalized linear fractional programming
• An algorithm for generalized fractional programs
• An effective branch and bound algorithm for minimax linear fractional programming
• An efficient algorithm for batch images alignment with adaptive rank-correction term
• An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
• An interior-point method for fractional programs with convex constraints
• An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
• Bibliography: Ninth bibliography of fractional programming
• Complex minimax fractional programming of analytic functions
• Efficient algorithm for globally computing the min–max linear fractional programming problem
• Generalized fractional programming and cutting plane algorithms
• scientific article; zbMATH DE number 6907481 (Why is no real title available?)
• scientific article; zbMATH DE number 1095224 (Why is no real title available?)
• Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
• Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
• Linear-fractional programming. Theory, methods, applications and software.
• Nondifferentiable minimax fractional programming in complex spaces with parametric duality
• Optimality conditions and duality for minimax fractional programming problems with data uncertainty
• Optimality conditions for nondifferentiable minimax fractional programming with complex variables
• Partial linearization for generalized fractional programming
• Range division and linearization algorithm for a class of linear ratios optimization problems
• Strong duality for robust minimax fractional programming problems

This page was built for publication: Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926925)