Technical Note—On Converse Duality in Nonlinear Programming

B. D. Craven and B. Mond
Additional contact information
B. D. Craven: University of Melbourne, Melbourne, Australia
B. Mond: La Trobe University, Bundoora, Melbourne, Australia

Operations Research, 1971, vol. 19, issue 4, 1075-1078

Abstract: Huard and Mangasarian have proved the converse duality theorem in mathematical programming by using the Kuhn-Tucker theorem. However, this note points out the advantages of using Fritz John's theorem.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.1075 (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:19:y:1971:i:4:p:1075-1078

Access Statistics for this article

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