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.
Accession Number:
AD0610950
Title:
GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING - I
Corporate Author:
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Report Date:
1964-08-05
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.
Supplementary Note:
Report is part of paper entitled 'Large Scale Linear Programming' presented at the IBM Symposium on Combinatorial Methods, Mar 1964. DOI: 10.21236/AD0610950
Pages:
0024
Distribution Statement:
Approved for public release; distribution is unlimited.
Contract Number:
NONR-222(83)
Contract Number 2:
NSF-GP-2633
File Size:
1.28MB
