An extended microcomputer-based network optimization package
Loading...
Authors
Finley, Michael Edward
Subjects
Network
Generalized network
Microcomputer
Optimization
Network with gains
Linear programming
Minimum cost network flow
Transshipment model
Mathematical programming
Generalized network
Microcomputer
Optimization
Network with gains
Linear programming
Minimum cost network flow
Transshipment model
Mathematical programming
Advisors
Brown, Gerald G.
Date of Issue
1982-10
Date
October 1982
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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 problems as well as the pure network specializations of these models, which include the personnel assignment problem, the maximum flow, and shortest path formulations. The generalized network problem, in turn, can be viewed as a specialization of a linear programming problem having at most two non-zero entries in each column of the constraint matrix. A detailed description is given of the implementation of an efficient algorithm and its supporting data structures, used to solve large scale, minimum-cost generalized transshipment problems on an Apple II (64K) microcomputer. A suite of advanced techniques for managing minimum-cost network flow models and inherent data elements will also be discussed.
Type
Thesis
Description
Series/Report No
Department
Operations Research
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.