A NETWORK DESIGN PROBLEM FOR A DISTRIBUTION-SYSTEM WITH UNCERTAIN DEMANDS

A class of production-distribution planning problems with nonstochasti c uncertain demands is modeled as a dynamic game between two players w ho control flows on a network viith node and are capacity constraints. Simple conditions are derived for determining which player wins the g ame. These conditions are then used to design a minimum cost network w ith the property that its feasible control strategies are allowed to m eet the demand without violating the capacity constraints.