Notes on linear programming--part XXXIII: a theorem on flows in networks.

by David Gale

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback18 pages $20.00 $16.00 20% Web Discount

A study which obtains a condition for the existence of a flow from the origins to the destinations (connected by a network of edges of specified finite capacity) such that the flows into the destinations attain prescribed values. The existence theorem, which generalizes a well-known combinatorial theorem of P. Hall, is then applied to a particular example

This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

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.