J Austral Math Soc Ser B 37 pp530--548, 1996.
(Received 18 April 1994; revised 19 August 1994)
This paper deals with a class of network optimization problems in which the flow is a function of time rather than static as in the classical network flow problem, and storage is permitted at the nodes. A solution method involving discretization will be presented as an application of the ASG algorithm. We furnish a proof that the discretized solution converges to the exact continuous solution. We also apply the method to a water distribution network where we minimize the cost of pumping water to meet supply and demand, subject to both linear and nonlinear constraints.
Last Modified: Mon Dec 10 13:43:34 2001