Minimum-cost flows in networks with upper bounded arcs and concave cost functions
Loading...
Authors
Hallenbeck, Wayne Jay
Subjects
Advisors
McMasters, Alan W.
Date of Issue
1972
Date
December 1972
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
An algorithm is presented for solving minimum-cost flow
problems in which each arc of the network has a finite
maximum flow capacity and a concave cost function associated
with sending flow along that arc. Each cost function is
broken into a series of cost increments through the use of
piecewise linear approximations. The algorithm takes any
feasible solution and recirculates flow over less costly
cycles to obtain an optimal solution. A modification which
handles the existence of non-zero lower bounds on flow
through the various arcs is also given.
Type
Thesis
Description
Series/Report No
Department
Operations Research and Administrative Sciences
Organization
Naval Postgraduate School
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.