ON THE MAX FLOW MIN CUT THEOREM OF NETWORKS

Abstract

It is shown that Menger's theorem and the Max Flow Min Cut Theorem on networks are applications of the duality theorem of linear inequality theory.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 15, 1955
Accession Number
AD0605014

Entities

People

  • D. R. Fulkerson
  • G. B. Dantzig

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Coefficients
  • Computer Programming
  • Convex Sets
  • Corporations
  • Equations
  • Flow Network
  • Inequalities
  • Linear Programming
  • Mathematics
  • Steady State
  • Theorems
  • Transportation

Readers

  • Operations Research