Technical Note—On Converse Duality for a Nondifferentiable Programming Problem

B. Mond
Additional contact information
B. Mond: LaTrobe University, Bundoora, Australia

Operations Research, 1977, vol. 25, issue 4, 713-715

Abstract: Some authors have assumed that the Kuhn-Tucker constraint qualification is always satisfied in a mathematical programming problem in which the nonlinear constraints define a convex set with nonempty interior. That this assumption is incorrect is shown by counterexample.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.4.713 (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:25:y:1977:i:4:p:713-715

Access Statistics for this article

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