The simplex algorithm for multicommodity networks

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. © 2002 John Wiley & Sons, Inc.