DUALITY AND NETWORK FLOW

Abstract

The report describes the notions of duality and network flow and shows how these are used in the construction of algorithms for certain classes of LP (linear programming) problems. Reports that the problems include transportation problem network flow at minimum cost, and scheduling of activities at minimum cost in a PERT-like, or critical-path, system of project organization.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 15, 1963
Accession Number
AD0402643

Entities

People

  • W. Karush

Organizations

  • System Development Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Equations
  • Flow
  • Government Procurement
  • Governments
  • Inequalities
  • Intervals
  • Linear Programming
  • Mathematical Programming
  • Numbers
  • Shipping
  • Simplex Method
  • Standards
  • Terminals
  • Transportation
  • United States

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Operations Research