Finding all linearly dependent rows in large-scale linear programming

被引：14

作者：

Andersen, ED ^{[1
]}

机构：

[1] ODENSE UNIV,DEPT MANAGEMENT,DK-5230 ODENSE M,DENMARK

来源：

OPTIMIZATION METHODS & SOFTWARE | 1995年 / 6卷 / 03期

关键词：

D O I：

10.1080/10556789508805634

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 reported.

引用

页码：219 / 227

页数：9