A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
From MaRDI portal
Publication:6569145
DOI10.1016/j.cam.2024.115900zbMATH Open1541.90339MaRDI QIDQ6569145
Peiping Shen, Yaping Deng, Yafei Wang
Publication date: 8 July 2024
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
convergence analysisglobal optimizationbranch-and-boundlinear relaxationminimax linear fractional programone-dimensional branching
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)
Cites Work
- An algorithm for generalized fractional programs
- Generic algorithm for generalized fractional programming
- Convergence of interval-type algorithms for generalized fractional programming
- Solving long-term financial planning problems via global optimization
- A unified monotonic approach to generalized linear fractional programming
- 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
- A new algorithm for generalized fractional programs
- An interior-point method for generalized linear-fractional programming
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- A new branch and bound algorithm for minimax ratios problems
- Prox-dual regularization algorithm for generalized fractional programs
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- A new linearization technique for minimax linear fractional programming
- A proximal point algorithm for generalized fractional programs
- Programming with linear fractional functionals
- Best Rational Approximation and Strict Quasi-Convexity
- 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
