Saturation in linear optimization

DOI10.1023/A:1023683723813zbMath1141.90560OpenAlexW1592565181MaRDI QIDQ1411507

Mariola Molina, Valentín Jornet, Miguel Angel Goberna

Publication date: 29 October 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023683723813

zbMATH Keywords

Linear programminglinear semi-infinite programmingredundancysaturationnonsaturation

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Semi-infinite programming (90C34)

Related Items (2)

Uniform saturation in linear inequality systems ⋮ Excess information in parametric linear optimization

Cites Work

• Unnamed Item
• 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

This page was built for publication: Saturation in linear optimization