A MODIFIED SIMPLEX ALGORITHM FOR SOLVING THE MULTI-COMMODITY MAXIMUM FLOW PROBLEM,

Abstract

The paper gives a detailed description of a modified simplex algorithm for solving the arc-chain formulation of the multi-commodity maximum flow problem. The modification of the simplex method is that of using a shortest path computation to replace the simplex step of selecting which vector enters the basis. Some computational results are also given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1968
Accession Number
AD0675822

Entities

People

  • Donald D. Boyer
  • Donald J. Hunt

Organizations

  • George Washington University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Computational Complexity
  • Computations
  • Mathematical Analysis
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Operations Research