Technical Note—On a Duality Theorem for a Nonlinear Programming Problem

Bertram Mond
Additional contact information
Bertram Mond: La Trobe University, Melbourne, Australia

Operations Research, 1973, vol. 21, issue 1, 369-370

Abstract: Duality theorems were given recently for a mathematical program with a nonlinear nondifferentiable objective function. Here we point out that the converse dual theorem holds without the usually stated restrictions and assumptions.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.369 (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:21:y:1973:i:1:p:369-370

Access Statistics for this article

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