Accession Number:

AD0702413

Title:

A MULTI-ITEM NETWORK FLOW MODEL WITH CAPACITY CONSTRAINTS.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF OPERATIONS RESEARCH HOUSE

Personal Author(s):

Report Date:

1969-12-01

Pagination or Media Count:

87.0

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE