The dual method of solving the linear programming problem
作者:
C. E. Lemke,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1954)
卷期:
Volume 1,
issue 1
页码: 36-47
ISSN:0028-1441
年代: 1954
DOI:10.1002/nav.3800010107
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractMany problems in logistics are capable of being formulated as linear programming problems. For example, one such problem is the so‐called transportation problem, which is concerned with obtaining the best way (in the sense of least time, or of least expense, etc.) of shipping stipulated quantities of materials from m origins to n destinations. This paper develops a new computational method of solving general linear programming problem
点击下载:
PDF
(594KB)
返 回