A comparison of the primal‐simplex and complementary pivot methods for linear programming
作者:
Arunachalam Ravindran,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1973)
卷期:
Volume 20,
issue 1
页码: 95-100
ISSN:0028-1441
年代: 1973
DOI:10.1002/nav.3800200109
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractA comparison of the complementary pivot method of Lemke‐Howson and the more commonly used primal‐simplex method for solving linear programming problems in symmetric dual form has been made. In our tests the complementary pivot method shows a definite superiority over the simplex method both with regard to the number of iterations and computation t
点击下载:
PDF
(334KB)
返 回