Finding all linearly dependent rows in large-scale linear programming
- 1 January 1995
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 6 (3) , 219-227
- https://doi.org/10.1080/10556789508805634
Abstract
All the new interior-point algorithms for linear programming (LP) assume that the rows of the constraint matrix are linearly independent. The assumption is necessary, because the algorithms solve a certain linear system which does not have a unique solution in the case of dependent rows. In this paper we study a pivoting based approach for finding all the linearly dependent rows. Moreover encouraging computational results are reportedKeywords
This publication has 5 references indexed in Scilit:
- Recovering an optimal LP basis from an interior point solutionOperations Research Letters, 1994
- Coldstart: Fleet Assignment at Delta Air LinesInterfaces, 1994
- MOPS — Mathematical optimization systemEuropean Journal of Operational Research, 1994
- Analysis of the Cholesky decomposition of a semi-definite matrixPublished by Oxford University Press (OUP) ,1990
- Finding duplicate rows in a linear programming modelOperations Research Letters, 1986