Constraint classification in mathematical programming
From MaRDI portal
Publication:689150
DOI10.1007/BF01582139zbMath0782.90104MaRDI QIDQ689150
Richard J. Caron, Arnon Boneh, Shahar Boneh
Publication date: 9 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
hit-and-runalgebraic inequality constraintsconstraint classificationfeasible set cover methodremoval of redundant constraintsweakly and strongly necessary constraints
Related Items (7)
Discovering the Characteristics of Mathematical Programs via Sampling ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Pattern search in the presence of degenerate linear constraints ⋮ Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints ⋮ Identifying redundant linear constraints in systems of linear matrix inequality constraints ⋮ Excess information in parametric linear optimization
Cites Work
- Redundancy in mathematical programming. A state-of-the-art survey
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
- A Greedy Heuristic for the Set-Covering Problem
- Identifying Minimally Infeasible Subsystems of Inequalities
This page was built for publication: Constraint classification in mathematical programming
