A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming

DOI10.1016/J.CAM.2024.115900MaRDI QIDQ6569145zbMATHFDO

Authors Peiping Shen, Ya-ping Deng, Yafei Wang

Publication date 8 July 2024

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

zbMATH Keywords

global optimizationconvergence analysisbranch-and-boundlinear relaxationminimax linear fractional programone-dimensional branching

Mathematics Subject Classification ID

Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 6907481
• An effective branch and bound algorithm for minimax linear fractional programming
• Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
• A new linearization technique for minimax linear fractional programming
• Efficient algorithm for globally computing the min–max linear fractional programming problem

Cites work

• A new algorithm for generalized fractional programs
• A new branch and bound algorithm for minimax ratios problems
• A new deterministic global computing algorithm for solving a kind of linear fractional programming
• A new linearization technique for minimax linear fractional programming
• A proximal point algorithm for generalized fractional programs
• A unified monotonic approach to generalized linear fractional programming
• An algorithm for generalized fractional programs
• An interior-point method for fractional programs with convex constraints
• An interior-point method for generalized linear-fractional programming
• An outcome space algorithm for minimizing a class of linear ratio optimization problems
• Best Rational Approximation and Strict Quasi-Convexity
• Convergence of interval-type algorithms for generalized fractional programming
• Duality in nondifferentiable minimax fractional programming with generalized convexity
• Generalized fractional programming and cutting plane algorithms
• Generic algorithm for generalized fractional programming
• Interval division and linearization algorithm for minimax linear fractional program
• Optimality conditions for nondifferentiable minimax fractional programming with complex variables
• Programming with linear fractional functionals
• Prox-dual regularization algorithm for generalized fractional programs
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Solving long-term financial planning problems via global optimization

Cited in

(1)

• Interval division and linearization algorithm for minimax linear fractional program

This page was built for publication: A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming

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