Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory

A. Charnes, W. W. Cooper and K. Kortanek
Additional contact information
A. Charnes: Northwestern University
W. W. Cooper: Carnegie Institute of Technology
K. Kortanek: Northwestern University

Management Science, 1963, vol. 9, issue 2, 209-228

Abstract: By constructing a new infinite dimensional space for which the extreme point--linear independence and opposite sign theorems of Charnes and Cooper continue to hold, and, building on a little-known work of Haar (herein presented), an extended dual theorem comparable in precision and exhaustiveness to the finite space theorem is developed. Building further on this a dual theorem is developed for arbitrary convex programs with convex constraints which subsumes in principle all characterizations of optimality or duality in convex programming. No differentiability or constraint qualifications are involved, and the theorem lends itself to new computational procedures.

Date: 1963
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.9.2.209 (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:ormnsc:v:9:y:1963:i:2:p:209-228

Access Statistics for this article

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