Duality in Fractional Programming: A Unified Approach

Siegfried Schaible
Additional contact information
Siegfried Schaible: Stanford University, Stanford, California

Operations Research, 1976, vol. 24, issue 3, 452-461

Abstract: This paper presents a unified method for obtaining duality results for concave-convex fractional programs. We obtain these results by transforming the original nonconvex programming problem into an equivalent convex program. Known results by several authors are related to each other. Moreover, we prove additional duality theorems, in particular, converse duality theorems for nondifferentiable as well as quadratic fractional programs.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.3.452 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:24:y:1976:i:3:p:452-461

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().