GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING - I
George B. Dantzig, Richard M. Van Slyke · 1964
Abstract : A variant of the simplex method is given for solving linear programs with M + L equations, L of which have the property that each variable has at most one nonzero coefficient. Special cases include transportation problems, programs with upper bounded variables, assignment and weighted distribution problems. The main feature of the algorithm is that a working basis of order 2M + 1 is utilized for pivoting, pricing, and inversion which for large L can be of significantly lower order than that of the original system.
Cited by 21 works. doi:10.21236/ad0610950