A novel affine relaxation-based algorithm for minimax affine fractional program
From MaRDI portal
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A new linearization technique for minimax linear fractional programming
- A note on the sum of a linear and linear-fractional function
- A potential practical algorithm for minimizing the sum of affine fractional functions
- A proximal point algorithm for generalized fractional programs
- An algorithm for generalized fractional programs
- An inexact proximal point method for solving generalized fractional programs
- An interior-point method for fractional programs with convex constraints
- Best Rational Approximation and Strict Quasi-Convexity
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Dual method of centers for solving generalized fractional programs
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- 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?)
- Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
- Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
- Linear-fractional programming. Theory, methods, applications and software.
- Lower subdifferentiability in minimax fractional programming*
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Partial linearization for generalized fractional programming
- Prox-regularization of the dual method of centers for generalized fractional programs
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Solving generalized polynomial problem by using new affine relaxed technique
- Solving long-term financial planning problems via global optimization
- Two-level linear relaxation method for generalized linear fractional programming
- Two-stage least squares based iterative estimation algorithm for CARARMA system modeling
Cited in
(2)
This page was built for publication: A novel affine relaxation-based algorithm for minimax affine fractional program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968601)
