Algorithms for construction of optimal and suboptimal solutions in network optimization problems
Л. А. Пилипчук, А. С. Пилипчук, Y. H. Pesheva · Digital Library of the Belarusian State University (Belarusian State University) · 2009
For a distributive flow programming optimization problem of a special structure direct and dual algorithms are constructed. These algorithms are based on a research of the theoretical and graph properties of the solution space bases. Optimality conditions are received, that allow to calculate a part of the components of the Lagrange vector. Algorithms that decompose calculation systems for pseudo-plans of the problem are presented. Suitable directions for change of the dual criterion function are constructed.