Performance evaluation of independent superbasic sets on nonlinear replicated networks
We describe a new type of network flow problems that basically consists of the classical transshipment problem with the following extensions: (1) The replication of a network by producing subnetworks with identical structure, being linked by so-called linking arcs; (2) the objective function terms related to the linking arcs are non-differentiable nonlinear functions. By using a networks-specialized implementation of a linearly constrained nonlinear programming algorithm described elsewhere, we report the computational performance of the new concept of independent superbasic sets that allows to obtain in parallel independent pieces of the solution at each iteration.
linearly constrained nonlinear programming
scientific article; zbMATH DE number 3932750
scientific article