On Network Flow Functions

Notes on Linear Programming and Extensions — Part 50

by Lloyd S. Shapley

Download

Full Document

FormatFile SizeNotes
PDF file 0.9 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.

Purchase

Purchase Print Copy

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

An investigation of the capacity of a network as a function of the capacities of its individual arcs. The case of two variable arcs is examined. It is found that in each pair of arcs they either con- sistently help each other or consistently hinder each other. Interaction types are computed for a number of special cases

Research conducted by

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.

Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.

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.