The simplex algorithm for multicommodity networks

Detlefsen, Nina and Wallace, Stein W (2002) The simplex algorithm for multicommodity networks. Networks, 39 (1). pp. 15-28. ISSN 0028-3045

Full text not available from this repository.


We consider multicommodity network flow problems, where external flow is allowed to vary and where flows of individual commodities may be constrained. For this problem, we describe the simplex algorithm. The simplex algorithm is based upon the inverse of the basis matrix. We discuss an approach where we only have to invert a working matrix with dimension at most equal to the number of arcs in the network. The dimension is independent of the number of commodities. The reduced cost of a nonbasic variable is found only using the working matrix that is explicitly inverted and some simple network operations. We also discuss how to pivot in the working matrix. The focus is on the detailed interpretation of the network structures arising in terms of cycles for the individual commodities.

Item Type:
Journal Article
Journal or Publication Title:
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
11 Jul 2011 18:31
Last Modified:
21 Nov 2022 21:23