Nonlinear network flow distribution problems with fixed and free node parameters

Abstract

The problem of flows distribution in networks presented as a connected flat graph is considered. This problem is formulated as an extremal one with nonlinear objective function and bilateral capacity bounds. In some continuity equations the right sides are presented as unknowns, i.e. optimization is realized not only over arc but over node variables as well. Solution algorithms based on nonlinear programming methods are proposed.