DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click HERE
to register or log in.
GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING - I
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
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.
Report is part of paper entitled 'Large Scale Linear Programming' presented at the IBM Symposium on Combinatorial Methods, Mar 1964. DOI: 10.21236/AD0610950
Approved for public release; distribution is unlimited.
Contract Number 2: