A comparative study of redundant constraints identification methods in linear programming problems
From MaRDI portal
Publication:624719
DOI10.1155/2010/723402zbMath1204.90069OpenAlexW1520461958WikidataQ58653294 ScholiaQ58653294MaRDI QIDQ624719
Publication date: 9 February 2011
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226288
Related Items (6)
Efficient model and heuristic for the intermodal terminal location problem ⋮ Constraint-adaptive MPC for linear systems: a system-theoretic framework for speeding up MPC through online constraint removal ⋮ System identification of MEMS vibratory gyroscope sensor ⋮ The generalized test collection problem ⋮ Adjustable Robust Optimization via Fourier–Motzkin Elimination ⋮ Local stability constraints
Uses Software
Cites Work
- Redundancy in mathematical programming. A state-of-the-art survey
- Constraint classification in mathematical programming
- On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Consistency, redundancy, and implied equalities in linear systems
- Presolving in linear programming
- On Trivial and Binding Constraints in Programming Problems
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- A heuristic approach for identification of redundant constraints in linear programming models
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- Two direct methods in linear programming
This page was built for publication: A comparative study of redundant constraints identification methods in linear programming problems
