On Network Flow Functions

Notes on Linear Programming and Extensions — Part 50

Lloyd S. Shapley

ResearchPublished 1959

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

Topics

Document Details

Citation

Chicago Manual of Style

Shapley, Lloyd S., On Network Flow Functions: Notes on Linear Programming and Extensions — Part 50. Santa Monica, CA: RAND Corporation, 1959. https://www.rand.org/pubs/research_memoranda/RM2338.html.
BibTeX RIS

Research conducted by

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included 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.