Finding duplicate rows in a linear programming model
From MaRDI portal
An algorithm for identifying and disposing of duplicate rows in a linear programming matrix is presented. This approach allows to reduce the model size in linear programming problems which decreases the cost of solution as well. It may also detect infeasible models and remove a potential source of numerical trouble in the simplex method. An example is presented, and computational experience is reported.
Recommendations
- scientific article; zbMATH DE number 1866915
- A heuristic approach for identification of redundant constraints in linear programming models
- scientific article; zbMATH DE number 1131726
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Locating Minimal Infeasible Constraint Sets in Linear Programs
Cites work
Cited in
(14)- A constraint selection technique for a class of linear programs
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- Equivalences between data envelopment analysis and the theory of redundancy in linear systems
- MOPS -- Mathematical optimization system
- Geometry of optimal value functions with applications to redundancy in linear programming
- Domain reduction techniques for global NLP and MINLP optimization
- A constraint selection technique in limit analysis
- Presolving in linear programming
- A heuristic approach for identification of redundant constraints in linear programming models
- A heuristic algorithm for resource allocation/reallocation problem
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
- A note on detecting simple redundancies in linear systems
- Graph problems arising from parameter identification of discrete dynamical systems
- Coefficient strengthening: a tool for reformulating mixed-integer programs
This page was built for publication: Finding duplicate rows in a linear programming model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090077)