Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Charnes, W. Cooper (1961)
Management Models and Industrial Applications of Linear Programming
Kurt Eisemann, Janice Lourie (1959)
The machine loading problem
A. Ferguson, G. Dantzig (1956)
The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain DemandManagement Science, 3
G. Dantzig (1965)
Linear programming and extensions
The purpose of the present paper is to extend the loop-technique of the stepping-stone algorithm to the generalized transportation problem. The main result (Theorem and Corollary of 6) is, that passing from a basic feasible solution to another one may always be carried out by constructing a simple symmetrical or a double loop (as defined in 2) and computing new values for the variables only along this path. The amount of computations needed for this turns out to be substantially reduced as compared to the usual way of solving the system of equations relating the new basis to the old one.
Management Science – INFORMS
Published: Sep 1, 1964
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.