Partial linearization for generalized fractional programming
From MaRDI portal
Recommendations
Cites work
- A note on an algorithm for generalized fractional programs
- An algorithm for generalized fractional programs
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Duality in generalized linear fractional programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Fractional programming
- Fractional programming: Applications and algorithms
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- On Nonlinear Fractional Programming
- Programming with linear fractional functionals
Cited in
(18)- Method of centers for generalized fractional programming
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- A novel affine relaxation-based algorithm for minimax affine fractional program
- Interval division and linearization algorithm for minimax linear fractional program
- On quality concepts fractional programming
- Dual method of centers for solving generalized fractional programs
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- Continuous-time generalized fractional programming
- A Fourth bibliography of fractional programming
- On polynomiality of the method of analytic centers for fractional problems
- A new approach for solving generalized linear fractional programming
- Generalized fractional programming: Algorithms and numerical experimentation
- Algorithms for generalized fractional programming
- Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems
- A new linearization technique for minimax linear fractional programming
This page was built for publication: Partial linearization for generalized fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786297)