Solving generalized networks
Brown, Gerald G.
McBride, Richard D.
MetadataShow full item record
A complete, unified description is given ot the design, implementation and use of a family ot very fast and etticient larye scale minimum-cost (primal simplex) network proyrams. The class ot capacitated generalized transshipment problems solved includes the capacitated and uncapaci tated generalized transportation problems and the continuous generalized assignment problem, as well as the pure network flow models which are specializations ot these problems. These formulations are used for a large number of diverse applications to determine how (or at what rate) flows through the arcs of a network can minimize total shipment costs. A generalized network problem can also be viewed as a linear program with at most two non-zero entries in each column ot the constraint matrix; this property is exploited in the mathematical presentation with special emphasis on data structures for basis representation, basis manipulation, and pricing mechanisms. a literature review accompanies computational testing ot promising ideas, and extensive experimentation is reported which has produced GENNET, an extremely efficient family of generalized network systems.
NPS Report NumberNPS55-82-012
Showing items related by title, author, creator and subject.
Finley, Michael Edward (Monterey, California. Naval Postgraduate School, 1982-10);The capacitated generalized transshipment problem is the most general and universally applicable member of the class of network optimization models. this model subsumes, as specializations, the capacitated transportation ...
Brown, Gerald G.; McBride, Richard D. (1984);A complete, unified description is given of the design, implementation and use of a family of very fast and efficient large-scale minimum-cost (primal simplex) network programs. The class of capacitated generalized ...
Bradley, Gordon H.; Brown, Gerald G.; Graves, Glen W. (1977-09);A complete description is given of the design, implementation and use of a family of very fast and efficient large scale minimum cost (primal simplex) network programs. The class of capacitated transshipment problems ...