On Trivial and Binding Constraints in Programming Problems
From MaRDI portal
Publication:2778968
DOI10.1287/mnsc.8.4.419zbMath0995.90612OpenAlexW2083371683MaRDI QIDQ2778968
Publication date: 22 October 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.8.4.419
Related Items (14)
General criteria for redundant and nonredundant linear inequalities ⋮ A constraint selection technique for a class of linear programs ⋮ A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary ⋮ Redundante Ungleichungen bei linearen Ungleichungssystemen ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I) ⋮ Zur Identifikation redundanter Nebenbedingungen in linearen Programmen ⋮ Saturation in linear optimization ⋮ Minimal representation of convex polyhedral sets ⋮ Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints ⋮ An algorithm for set covering problem ⋮ A constraint selection technique in limit analysis ⋮ Uniform saturation in linear inequality systems ⋮ Excess information in parametric linear optimization
This page was built for publication: On Trivial and Binding Constraints in Programming Problems
