Journal article
On extreme points of bounded sets of generalized finite sequence spaces
Zeitschrift für Operations Research, Vol.27(1), pp.145-157
12/1983
DOI: 10.1007/BF01916910
Abstract
The Linear Independence Extreme Point Theorem and Opposite Sign Theorem of semiinfinite programming provide algebraic characterizations of unbounded infinite dimensional convex polyhedral sets in terms of their extreme points. The Charnes, Kortanek, and Raike purification algorithm, which transforms any non-extreme point to an extreme point having objective function value at least as great, is based upon the constructive proofs of these two theorems.
In this paper these extreme point characterizations are extended to additionally constrained, bounded convex polyhedral constraint sets of semi-infinite programming. It is shown that each of these bounded sets is spanned by a possibly infinite number of extreme points, and as before the proofs are constructive, thereby expanding the range of applicability of the purification algorithm to these cases.
Details
- Title: Subtitle
- On extreme points of bounded sets of generalized finite sequence spaces
- Creators
- K. O. Kortanek - Carnegie Mellon UniversityH. M. Strojwas - Carnegie Mellon University
- Resource Type
- Journal article
- Publication Details
- Zeitschrift für Operations Research, Vol.27(1), pp.145-157
- DOI
- 10.1007/BF01916910
- ISSN
- 0340-9422
- eISSN
- 1432-5217
- Number of pages
- 13
- Language
- English
- Date published
- 12/1983
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963215302771
Metrics
3 Record Views