The dual method of solving the linear programming problem

C. E. Lemke

Naval Research Logistics Quarterly, 1954, vol. 1, issue 1, 36-47

Abstract: Many 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 problems.

Date: 1954
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/nav.3800010107

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:1:y:1954:i:1:p:36-47

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().