Saturation in Linear Optimization

M.A. Goberna, V. Jornet and M. Molina
Additional contact information
M.A. Goberna: University of Alicante
V. Jornet: University of Alicante
M. Molina: University of Alicante

Journal of Optimization Theory and Applications, 2003, vol. 117, issue 2, No 5, 327-348

Abstract: Abstract In a solvable linear optimization problem, a constraint is saturated if it is binding at a certain optimal solution and it is weakly saturated if it is binding at a proper subset of the optimal set. Nonsaturation and weak saturation can be seen as redundancy phenomena in the sense that the elimination of a finite number of these constraints preserves the value of the given problem. We consider also the effect of sufficiently small perturbations of the cost coefficients in the classification of a given constraint as either saturated or nonsaturated.

Keywords: Linear programming; linear semi-infinite programming; saturation; nonsaturation; redundancy (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1023683723813 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:joptap:v:117:y:2003:i:2:d:10.1023_a:1023683723813

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1023683723813

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().