Abstract
Redundant constraints in linear inequality systems can be characterized as those inequalities that can be removed from an arbitrary linear optimization problem posed on its solution set without modifying its value and its optimal set. A constraint is saturated in a given linear optimization problem when it is binding at the optimal set. Saturation is a property related with the preservation of the value and the optimal set under the elimination of the given constraint, phenomena which can be seen as weaker forms of excess information in linear optimization problems. We say that an inequality of a given linear inequality system is uniformly saturated when it is saturated for any solvable linear optimization problem posed on its solution set. This paper characterizes the uniform saturated inequalities and other related classes of inequalities.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boot J.C.G. (1962). On Trivial and Binding Constraints in Programming Problems.Management Science 8, 419–441.
Goberna M.A., Jornet V. and Molina M. (2003a). Saturation in Linear Optimization.Journal of Optimization Theory and Applications 117, 327–348.
Goberna M.A., Larriqueta M. and Vera de Serio V. (2003b). On the Stability of the Feasible Set in Linear Optimization.Set Valued Analysis 19, 203–223.
Goberna M.A. and López M.A. (1998).Linear Semi-Infinite Optimization. John Wiley.
Goberna M.A., Mira J.A. and Torregrosa G. (1998b). Redundancy in Linear Semi-Infinite Systems.Numerical Functional Analysis and Optimization 19, 529–548.
Greenberg H.J. (1996). Consistency, Redundancy, and Implied Equalities in Linear Systems.Annals of Mathematics and Artificial Intelligence 17, 37–83.
Holmes R.B. (1975).Geometric Functional Analysis and its Applications. Springer Verlag.
Karwan M., Lofti V., Telgen J. and Zionts S. (1983).Redundancy in Mathematical Programming. Springer Verlag.
Mauri M. (1975). Vincoli Superflui e Variabili Estranea in Programazioni Lineare.Ricerca Operativa 5, 21–42.
Rockafellar R.T. (1970).Convex Analysis. Princeton University Press.
Author information
Authors and Affiliations
Additional information
This work was supported by the MCYT of Spain and FEDER of UE, Grant BFM2002-04114-C02-01.
Rights and permissions
About this article
Cite this article
Goberna, M.A., Jornet, V. & Molina, M. Uniform saturation in linear inequality systems. Top 13, 167–184 (2005). https://doi.org/10.1007/BF02578993
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02578993