Optimal capacity expansion in a flow network
McMasters, Alan W.
MetadataShow full item record
The 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 problems
NPS Report NumberNPS55MG72091A
Showing items related by title, author, creator and subject.
Singh, Kavinesh J.; Philpott, Andy B.; Wood, Kevin (2009);We describe a multistage, stochastic, mixed-integer programming model for planning capacity expansion of production facilities. A scenario tree represents uncertainty in the mode; a general mixed-integer program defines ...
Farlow, Charles R. (Monterey, California. Naval Postgraduate School, 2011-03);The Sacramento region is prone to flooding disasters. This thesis uses an optimization model to recommend where to preposition and/or expand warehouses, health-care personnel, ramp space, and transportation vehicle capacity. ...
Naval Postgraduate School Center for Homeland Defense and Security (CHDS) (Monterey, California. Naval Postgraduate SchoolCenter for Homeland Defense and Security, 2006-07);July 2006. The July 2006 issue of Homeland Security Affairs offers articles about risk perception, domestic right wing extremist groups, social network analysis, and the impact of foreign policy on homeland security. It ...