Optimal flow pattern in undersaturated packet-switched networks

An optimal control algorithm for solving dynamic nonlinear discrete time linearly constrained optimisation problems based on feasible direction search and the reduced gradient is applied to calculating the optimal flow pattern in undersaturated, single destination packet-switched networks with time-varying demand flows. A numerical example is presented to demonstrate the feasibility of the approach. The computing time necessary to solve the example problem indicates that this approach could be considered as a feasible alternative to other existing optimization methods