Saturation in linear optimization
From MaRDI portal
Publication:1411507
DOI10.1023/A:1023683723813zbMath1141.90560MaRDI QIDQ1411507
Miguel Angel Goberna, Valentín Jornet, Mariola Molina
Publication date: 29 October 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
90C31: Sensitivity, stability, parametric optimization
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90C34: Semi-infinite programming
Related Items
Uniform saturation in linear inequality systems, Excess information in parametric linear optimization
Cites Work
- Some characterizations of convex polyhedra
- A theory of linear inequality systems
- Locally Farkas-Minkowski linear inequality systems
- Locally polyhedral linear inequality systems
- Consistency, redundancy, and implied equalities in linear systems
- On Trivial and Binding Constraints in Programming Problems
- Redundancy in linear inequality system
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- Convex Analysis
- Unnamed Item