Journal article
Constructing a perfect duality in infinite programming
Applied mathematics & optimization, Vol.3(4), pp.357-372
12/1976
DOI: 10.1007/BF01448186
Abstract
One version of the infinite Farkas Lemma states the equivalence of two conditions, (1)y⋅b ⩾ 0 whenevery⋅a j ⩾ 0 forj=1,2,.. and (2)b ∈ cl C, whereb and alla j are inR n andC is the convex cone spanned by all thea j's. In this paper an ascent vector specifies a direction along which an arbitrarily small movement fromb with enterC. A Fredholm type theorem of the alternative characterizes the set of all ascent vectors associated with an arbitrary system of linear inhomogeneous inequalities in a finite number of variables. As a consequence, a pair of infinite programs is constructed which is in perfect duality in the sense that (p1) if one program is consistent and has finite value, then the other is consistent and (p2) if both programs are consistent, then they have the same finite value. The duality is sharp in that the set of all feasible perturbations along rays is determined.
Details
- Title: Subtitle
- Constructing a perfect duality in infinite programming
- Creators
- K. O. Kortanek - Carnegie Mellon University
- Resource Type
- Journal article
- Publication Details
- Applied mathematics & optimization, Vol.3(4), pp.357-372
- DOI
- 10.1007/BF01448186
- ISSN
- 0095-4616
- eISSN
- 1432-0606
- Number of pages
- 16
- Language
- English
- Date published
- 12/1976
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963208402771
Metrics
1 Record Views