Show simple item record

dc.contributor.authorMcMasters, Alan W.
dc.date9/12/1972
dc.date.accessioned2013-02-27T23:37:36Z
dc.date.available2013-02-27T23:37:36Z
dc.date.issued1972-09-12
dc.identifier.urihttp://hdl.handle.net/10945/29438
dc.description.abstractThe capacity expansion problem for flow networks, first studied by D. R. Fulkerson, is reexamined. In the case where no free initial capacity is available, it is shown that the optimal expansion takes place on the arcs of the cheapest chain in the sense of unit expansion costs through the network. The proof makes use of Dantzig's decomposition principle of linear programming. In the case where some free initial capacity is available, an algorithm based on the topological dual is presented. This algorithm does not require that the flow network be planar and can be easily extended to problems having positive lower bound restrictions on arc flows, problems having bounds on individual arc expansion or nonlinear convex expansion costs, and capacity reduction problemsen_US
dc.description.sponsorshipFoundation Research Program of the Naval Postgraduate Schoolen_US
dc.description.urihttp://archive.org/details/optimalcapacitye00mcma
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.subject.lcshUNDERWATER ACOUSTICS.en_US
dc.titleOptimal capacity expansion in a flow networken_US
dc.typeTechnical Reporten_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.identifier.npsreportNPS55MG72091A


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record