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

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

Published 1956

by David Gale

Purchase Print Copy

 Format Price
Add to Cart Paperback18 pages $20.00

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 research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

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.

RAND 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.