On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions

A. Charnes, W. W. Cooper and K. O. Kortanek

Naval Research Logistics Quarterly, 1969, vol. 16, issue 1, 41-52

Abstract: We first present a survey on the theory of semi‐infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi‐infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n‐space with maximization of a linear function in non‐negative variables of a generalized finite sequence space subject to a finite system of linear equations. We then present a new generalization of the Kuhn‐Tucker saddle‐point equivalence theorem for arbitrary convex functions in n‐space where differentiability is no longer assumed.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/nav.3800160104

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:wly:navlog:v:16:y:1969:i:1:p:41-52

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().