Accession Number:

AD0608270

Title:

MINIMUM CONVEX-COST FLOWS IN NETWORKS

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1964-11-01

Pagination or Media Count:

23.0

Abstract:

An algorithm is given for solving minimum cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. For example, problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max-Flow Min-Cut Theorem may all be formulated into minimum convex-cost flow problems.

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE