References
- Anderson , E. D. and Andersen , K. D. 1995 . Presolving in linear programming . Mathematical Programming Series B , 71 : 221 – 245 .
- Brearley , A. L. , Mitra , G. and Williams , H. P. 1975 . Analysis of mathematical programming problem prior to applying the simplex algorithm . Mathematical Programming , 8 : 54 – 83 .
- Gowdzio , J. 1997 . Presolve analysis of linear program prior to applying an interior point method . INFORMS: Journal on Computing , 9 : 73 – 91 .
- Ioslovich , I. 2002 . Robust reduction of a class of large scale linear program . SIAM Journal on Optimization , 12 : 262 – 282 .
- Karwan , M. H. , Loffi , V. , Telgan , J. and Zionts , S. 1983 . Redundancy in Mathematical Programming: A State of the Art Survey , Berlin : Springer-Verlag .
- Kuhn , H. W. and Quandt , R. E. 1962 . “ An experimental study of the simplex method ” . In Proceedings of Symposia in Applied Mathematics , Edited by: Metropolis , N. Vol. 15 , 107 – 124 . Providence, RI : American Mathematical Society .
- Mattheiss , T. H. 1973 . An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities . Operations Research , 21 : 247 – 260 .
- Meszaros , C. and Suhl , U. H. 2003 . Advanced preprocessing techniques for linear and quadratic programming . OR Spectrum , 25 : 575 – 595 .
- Stojkovic , N. V. and Stanimirovic , P. S. 2001 . Two direct methods in linear programming . European Journal of Operational Research , 131 : 417 – 439 .
- Telgan , J. 1983 . Identifying redundant constraints and implicit equalities in system of linear constraints . Management Science , 29 : 1209 – 1222 .
- Tomlin , J. A. and Wetch , J. S. 1986 . Finding duplicate rows in a linear programming model . Operations Research Letters , 5 : 7 – 11 .