Notes on Linear Programming

Part XLIV Transient Flows in Networks

David Gale

ResearchPublished 1958

A study concerned with flows in two-terminal dynamic networks as defined by Ford and Fulkerson (RM-1981). These authors have shown how to construct for each positive integer k a flow <> that maximizes the amount <> shipped from source to sink in k time periods. Their method leads to different functions <> for different values of k. The present research memorandum shows that the problem can be solved by a single flow <> when k maximizes the cumulative amount shipped from source to sink. The conclusion holds even when the capacities and transit times in the network are allowed to vary with time. The results of this study may be applied in analyzing logistics problems involving railway networks.

Order a Print Copy

Format
Paperback
Page count
17 pages
List Price
$20.00
Buy link
Add to Cart

Topics

Document Details

  • Copyright: RAND Corporation
  • Availability: Available
  • Year: 1958
  • Print Format: Paperback
  • Paperback Pages: 17
  • Paperback Price: $20.00
  • Document Number: RM-2152

Citation

RAND Style Manual
Gale, David, Notes on Linear Programming: Part XLIV Transient Flows in Networks, RAND Corporation, RM-2152, 1958. As of September 12, 2024: https://www.rand.org/pubs/research_memoranda/RM2152.html
Chicago Manual of Style
Gale, David, Notes on Linear Programming: Part XLIV Transient Flows in Networks. Santa Monica, CA: RAND Corporation, 1958. https://www.rand.org/pubs/research_memoranda/RM2152.html. Also available in print form.
BibTeX RIS

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.