Generalized fractional programming: Algorithms and numerical experimentation

DOI10.1016/0377-2217(85)90287-5zbMath0564.90081OpenAlexW1979134182MaRDI QIDQ1058468

Jacques A. Ferland, Jean-Yves Potvin

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90287-5

zbMATH Keywords

generalized fractional programDinkelbach approachNewton approach

Mathematics Subject Classification ID

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

Related Items

Restoration of efficiency in a goal programming problem with linear fractional criteria, Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control, An interior-point method for multifractional programs with convex constraints, Generalized fractional programming duality: A parametric approach, A reference point technique to compute nondominated solutions in MOLFP, Optimality conditions and duality for a class of continuous-time generalized fractional programming problems, Generalized fractional programming and cutting plane algorithms, A new algorithm for generalized fractional programs, On polynomiality of the method of analytic centers for fractional problems, Convergence of interval-type algorithms for generalized fractional programming, Using duality to solve generalized fractional programming problems, Convergence of a Dinkelbach-type algorithm in generalized fractional programming, A Fourth bibliography of fractional programming, Enhancing computations of nondominated solutions in MOLFP via reference points, Fractional programming by lower subdifferentiability techniques, Continuous-time generalized fractional programming, Algorithms for generalized fractional programming, Fractional Programming — Some Recent Developments, Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program, A Cutting Plane Algorithm for Min-Max Fractional Programming, Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions, Processors selection and traffic splitting in a parallel processors system, Preference approach to fuzzy linear inequalities and optimizations, Duality for generalized fractional programs involving n-set functions, Revisiting Dinkelbach-type algorithms for generalized fractional programs, Generic algorithm for generalized fractional programming, Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions, Solving special nonlinear fractional programming problems via parametric linear programming

Cites Work

• Unnamed Item
• Max-min resource allocation
• An algorithm for generalized fractional programs
• Duality in generalized fractional programming via Farkas' lemma
• Duality in generalized linear fractional programming
• Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
• Parametric approaches to fractional programs
• On Nonlinear Fractional Programming