IJPAM: Volume 60, No. 3 (2010)

DECOMPOSITION OF THE NETWORK SUPPORT FOR
ONE NON-HOMOGENEOUS NETWORK FLOW
PROGRAMMING PROBLEM

L.A. Pilipchuk$^1$, A.S. Pilipchuk$^2$, Y.H. Pesheva$^3$
$^1$Belarussian State University
4, Nezalezhnosti Ave., Minsk, 220050, BELARUS
e-mail: [email protected]
$^2$State Scientific Institution
99, Academician A.K. Krasin Str., Minsk, 220109, BELARUS
e-mail: [email protected]
$^3$Department of Differential Equations
Faculty of Applied Mathematics and Informatics
Technical University of Sofia
P.O. Box 384, Sofia, 1000, BULGARIA
e-mail: [email protected]


Abstract.We consider one extremal linear non-homogeneous problem of flow programming with additional constraints of general kind. We use the network properties of the non-homogeneous problem for the decomposition of a network support into trees and cyclic parts.

Received: March 20, 2010

AMS Subject Classification: 65K05, 90C08, 90C35, 15A06

Key Words and Phrases: multicommodity network flow programming, transportation problem, sparse matrices, decomposition of support, fundamental system of cycles, direct method, spanning tree, cyclic arc

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2010
Volume: 60
Issue: 3