Hostname: page-component-76d6cb85b7-8p85h Total loading time: 0 Render date: 2026-07-21T06:58:34.065Z Has data issue: false hasContentIssue false
  • English
  • Français

An alternative method for linear programming

Published online by Cambridge University Press:  24 October 2008

E. M. L. Beale
E. M. L. Beale
Affiliation:
Admiralty Research Laboratory Teddington, Middlesex
Get access Rights & Permissions [Opens in a new window]

Abstract

The method of leading variables is presented as a new method of solving Linear Programming, and is compared with the Simplex and the Dual Simplex methods.

Information

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 50 , Issue 4 , October 1954 , pp. 513 - 523
Copyright
Copyright © Cambridge Philosophical Society 1954

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

(1) Charnes, A., Cooper, W. W. and Henderson, A. An Introduction to Linear Programming (New York and London, 1953).Google Scholar
(2) Dantzig, G. B. Activity Analysis of Production and Allocation. Cowles Commission for Research in Economics, Monograph 13 (New York, 1951), chapter XXI.Google Scholar
(3) Dantzig, G. B., Orden, A. and Wolfe, P. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints. Rand Corp. P–392 (Santa Monica, 1954).Google Scholar
(4) Lemke, C. E. The Dual Method of Solving the Linear Programming Problem. Carnegie Institute of Technology, Dept. of Math. Technical Report No. 29, 1953.Google Scholar