Constraint classification in mathematical programming
From MaRDI portal
(Redirected from Publication:689150)
Recommendations
- 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
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- 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
- 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
Cited in
(8)- Discovering the Characteristics of Mathematical Programs via Sampling
- Pattern search in the presence of degenerate linear constraints
- Identifying redundant linear constraints in systems of linear matrix inequality constraints
- Consistency, redundancy, and implied equalities in linear systems
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints
- Excess information in parametric linear optimization
- A comparative study of redundant constraints identification methods in linear programming problems
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)
