科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper proposes a strongly polynomial algorithm which either finds a solution of a linear system Ax = b, 0 a parts per thousand currency sign x a parts per thousand currency sign 1, or correctly decides that the system has no 0,1-solutions. The algorithm can be used as the basis for the construction of a polynomial algorithm for linear programming.
- 出版日期2012-9
