Analysis of a class of fractional programming problems

DOI10.1007/BF01582297zbMath0676.90085OpenAlexW2014693708MaRDI QIDQ1123137

Moshe Sniedovich

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582297

zbMATH Keywords

convexity conditionsC-programming

Mathematics Subject Classification ID

Fractional programming (90C32)

Related Items

Experiments with dynamic programming algorithms for nonseparable problems ⋮ Solving a class of multiplicative programming problems via \(C\)- programming ⋮ A Fourth bibliography of fractional programming ⋮ Method of centers for generalized fractional programming ⋮ A class of dual fuzzy dynamic programs ⋮ The simplex method as a global optimizer: A \(C\)-programming perspective ⋮ Solution strategies for variance minimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• C-programming and the minimization of pseudolinear and additive concave functions
• C-programming problems: A class of non-linear optimization problems
• Analysis of a class of proxy problems
• C-programming. An outline
• Maximal mean/standard deviation ratio in an undiscounted MDP
• A class of nonseparable dynamic programming problems
• Fractional Programming. II, On Dinkelbach's Algorithm
• Parametric approaches to fractional programs
• On Nonlinear Fractional Programming
• Fractional programming