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

DOI10.1007/BF00934364MaRDI QIDQ1151834zbMATH OpenOpenAlexFDO

Authors 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

convex fractional programsequivalenceFenchel dualitysaddle-point theorem

Mathematics Subject Classification ID

Fractional programming (90C32)

Cites work

• A Fourth bibliography of fractional programming
• Duality and Sensitivity Analysis for Fractional Programs
• Duality for nonlinear fractional programs
• Duality in Fractional Programming: A Unified Approach
• Duality in nonlinear fractional programming
• Duality theorems for certain programs involving minimum or maximum operations
• Fractional programming without differentiability
• Fractional Programming. I, Duality
• scientific article; zbMATH DE number 3614491 (Why is no real title available?)
• On Nonlinear Fractional Programming
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Programming with linear fractional functionals

Cited in

(4)

• scientific article; zbMATH DE number 3928745 (Why is no real title available?)
• Global saddle-point duality for quasi-concave programs
• Bibliography in fractional programming
• Fractional programming

This page was built for publication: Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151834)