Partial linearization for generalized fractional programming

DOI10.1007/BF01919185zbMath0643.90086MaRDI QIDQ3786297

Y. Benadada, Jacques A. Ferland

Publication date: 1988

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

partial linearizationgeneralized fractional programgeneralized Dinkelbach algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32)

Related Items

Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control, A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints, A new linearization technique for minimax linear fractional programming, On polynomiality of the method of analytic centers for fractional problems, Dual method of centers for solving generalized fractional programs, Interval division and linearization algorithm for minimax linear fractional program, A Fourth bibliography of fractional programming, Continuous-time generalized fractional programming, Algorithms for generalized fractional programming, On quality concepts fractional programming, Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations, Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions

Cites Work

• An algorithm for generalized fractional programs
• A note on an algorithm for generalized fractional programs
• Fractional programming: Applications and algorithms
• Duality in generalized linear fractional programming
• Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
• Convergence of a Dinkelbach-type algorithm in generalized fractional programming
• Fractional Programming. II, On Dinkelbach's Algorithm
• Programming with linear fractional functionals
• On Nonlinear Fractional Programming
• Fractional programming