Pseudo-Concave Programming and Lagrange Regularity

K. O. Kortanek and J. P. Evans
Additional contact information
K. O. Kortanek: Cornell University, Ithaca, New York
J. P. Evans: Cornell University, Ithaca, New York

Operations Research, 1967, vol. 15, issue 5, 882-891

Abstract: For the mathematical programming problem max f ( x ) subject to G ( x ) ≧ 0, we show that if G ( x ) is pseudo-concave, a property weaker than concavity but stronger than quasi-concavity, and differentiable, then the constraint set is necessarily determined by the natural gradient (tangent) inequality system of G . We then apply the duality constructs of semi-infinite programming, in a manner which admits generalizations, to this special case to show that pseudo-concave constraint functions that have an interior point are convex Lagrange regular. Analogous to a theorem of Arrow-Hurwicz-Uzawa, we characterize functions that are both pseudo-concave and pseudo-convex, and for programming problems with objective functions of this form, we obtain equivalent problems having linear objective functions.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.5.882 (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:15:y:1967:i:5:p:882-891

Access Statistics for this article

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