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 viith node and are 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.