Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs

DOI10.1007/BF00934364zbMath0458.90068OpenAlexW2017361793MaRDI QIDQ1151834

Jacob Flachs, Moshe A. Pollatschek

Publication date: 1982

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

equivalencesaddle-point theoremFenchel dualityconvex fractional programs

Mathematics Subject Classification ID

Fractional programming (90C32)

Related Items

Fractional programming, Unnamed Item, Global saddle-point duality for quasi-concave programs, Bibliography in fractional programming

Cites Work

• Unnamed Item
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Fractional Programming. I, Duality
• Duality in Fractional Programming: A Unified Approach
• Fractional programming without differentiability
• Duality and Sensitivity Analysis for Fractional Programs
• Duality theorems for certain programs involving minimum or maximum operations
• A Fourth bibliography of fractional programming
• Programming with linear fractional functionals
• On Nonlinear Fractional Programming
• Duality for nonlinear fractional programs
• Duality in nonlinear fractional programming