A MULTI-ITEM NETWORK FLOW MODEL WITH CAPACITY CONSTRAINTS.

Abstract

A multi-item network flow model with capacity constraints is reformulated into the classical multicommodity flow problem. An L-U decomposition of block matrices is used to modify the revised simplex method to improve computational efficiency. Advantage is taken of the triangular basis of the one commodity sub problems and the expected low number of tight capacity constraints. Included is an example and an illustration of the principle of the L-U decomposition.

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1969
Accession Number
AD0702413

Entities

People

  • Steven F. Maier

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Chemical Reactions
  • Commerce
  • Commodities
  • Contract Administration
  • Contracts
  • Decomposition
  • Efficiency
  • Simplex Method

Readers

  • Operations Research