Linear problems of optimization of non-homogeneous flows in the generalized network

Abstract

In the paper we consider non-homogeneous network flow programming problems with constraints of the embedded network structure. The algorithms use the properties of the basis of the solution space of homogeneous systems. One of the key steps are the algorithms of decomposition. We build direct, dual and adaptive methods for construction of optimal solutions in non-homogeneous network optimization in generalized networks.