A Network Design Problem for a Distribution System with Uncertain Demands

A class of production--distribution planning problems with nonstochastic uncertain demands is modeled as a dynamic game between two players who control flows on a network with node and arc capacity constraints. Simple conditions are derived for determining which player wins the game. These conditions are then used to design a minimum cost network with the property that its feasible control strategies are allowed to meet the demand without violating the capacity constraints.

[1]  Graham K. Rand,et al.  Decision Systems for Inventory Management and Production Planning , 1979 .

[2]  Endre Boros,et al.  On the Existence of a Feasible Flow in a Stochastic Transportation Network , 1991, Oper. Res..

[3]  Franco Blanchini,et al.  A feedback strategy for periodic network flows , 1996, Networks.

[4]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[5]  Edward J. Davison,et al.  A decentralized discrete-time controller for dynamic routing , 1990, 29th IEEE Conference on Decision and Control.

[6]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[7]  F. Schweppe,et al.  Control of linear dynamic systems with set constrained disturbances , 1971 .

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Per-olof Gutman,et al.  Admissible sets and feedback control for discrete-time linear dynamical systems with bounded controls and states , 1984, The 23rd IEEE Conference on Decision and Control.

[10]  W. Ukovich,et al.  Linear programming approach to the control of discrete-time periodic systems with uncertain inputs , 1993 .

[11]  E. Gilbert,et al.  Computation of minimum-time feedback control laws for discrete-time systems with state-control constraints , 1987 .

[12]  S. Thomas McCormick,et al.  Submodular containment is hard, even for networks , 1996, Oper. Res. Lett..

[13]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[14]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[15]  James B. Orlin,et al.  Minimum Convex Cost Dynamic Network Flows , 1984, Math. Oper. Res..

[16]  Jay E. Aronson,et al.  A survey of dynamic network flows , 1989 .

[17]  J. Muckstadt,et al.  Analysis of Multistage Production Systems , 1988 .

[18]  András Frank,et al.  Generalized polymatroids and submodular flows , 1988, Math. Program..

[19]  Edward J. Davison,et al.  Decentralized Robust Control for Dynamic Routing of Large Scale Networks , 1990, 1990 American Control Conference.

[20]  Tamer Başar,et al.  H1-Optimal Control and Related Minimax Design Problems , 1995 .

[21]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[22]  R. Brown,et al.  Extension of validity of GRG method in optimal control calculation , 1976 .

[23]  Roger J.-B. Wets,et al.  The facets of the polyhedral set determined by the Gale—Hoffman inequalities , 1993, Math. Program..

[24]  D. Bertsekas.  Infinite time reachability of state-space regions by using feedback control , 1972 .

[25]  K. Sridhar Moorthy,et al.  Chapter 4 Competitive marketing strategies: Game-theoretic models , 1993, Marketing.

[26]  A. Segall,et al.  An optimal control approach to dynamic routing in networks , 1982 .

[27]  藤重 悟.  Submodular functions and optimization , 1991 .