Constraint classification in mathematical programming
Consider a set of algebraic inequality constraints defining either an empty or a nonempty feasible region. It is known that each constraint can be classified as either absolutely strongly redundant, relatively strongly redundant, absolutely weakly redundant, relatively weakly redundant, or necessary. We show that it is worth making a distinction between weakly necessary constraints and strongly necessary constraints. We also present a feasible set cover method which can detect both weakly and strongly necessary constraints. The main interest in constraint classification is due to the advantages gained by the removal of redundant constraints. Since classification errors are likely to occur, we examine how the removal of a single constraint can affect the classification of the remaining constraints.
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Redundancy in linear inequality system
- scientific article; zbMATH DE number 3912109
- On linear inequality systems without strongly redundant constraints
- General criteria for redundant and nonredundant linear inequalities
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- A Greedy Heuristic for the Set-Covering Problem
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- Identifying Minimally Infeasible Subsystems of Inequalities
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
- 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
- Consistency, redundancy, and implied equalities in linear systems
- Excess information in parametric linear optimization
- Pattern search in the presence of degenerate linear constraints
- Discovering the Characteristics of Mathematical Programs via Sampling
- Identifying redundant linear constraints in systems of linear matrix inequality constraints
- A comparative study of redundant constraints identification methods in linear programming problems
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints
This page was built for publication: Constraint classification in mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689150)
