A restatement of the problem of meeting required multicommodity network flows at minimum cost. In this Note the problem is shown to be a special case of a second, more general problem in which one is attempting to meet minimum cost multicommodity flows without flow requirements on the individual commodities. An algorithm developed for the original problem, programmed in node-arc and arc-chain forms and adjusted by applying the Dantzig-Wolfe decomposition principle, is then modified to solve the more general problem. The Dantzig-Wolfe principle treats the master program as convex combinations of extreme points of derived subprograms. Subsequently, the subprograms are homogeneous and the master program is a nonnegative combination of independent subprogram solutions. 10 pp. Ref.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.