A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
DOI10.1016/J.CAM.2024.115900zbMATH Open1541.90339MaRDI QIDQ6569145FDOQ6569145
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)
global optimizationconvergence analysisbranch-and-boundlinear relaxationminimax linear fractional programone-dimensional branching
Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Programming with linear fractional functionals
- An interior-point method for generalized linear-fractional programming
- A unified monotonic approach to generalized linear fractional programming
- Solving long-term financial planning problems via global optimization
- An algorithm for generalized fractional programs
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- A new linearization technique for minimax linear fractional programming
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Convergence of interval-type algorithms for generalized fractional programming
- Generic algorithm for generalized fractional programming
- A new algorithm for generalized fractional programs
- Best Rational Approximation and Strict Quasi-Convexity
- Generalized fractional programming and cutting plane algorithms
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Prox-dual regularization algorithm for generalized fractional programs
- A proximal point algorithm for generalized fractional programs
- A new branch and bound algorithm for minimax ratios problems
- An interior-point method for fractional programs with convex constraints
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- 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)
