Accession Number:

ADA056761

Title:

A Network Augmenting Path Basis Algorithm for Transshipment Problems.

Descriptive Note:

Research rept.,

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s):

• Barr,Richard
• Elam,Joyce
• Glover,Fred
• Klingman,Darwin

Report Date:

1978-03-01

Pagination or Media Count:

35.0

Abstract:

The purpose of this paper is to present a new simplex algorithm for solving capacitated transshipment network problems which both circumvents and exploits the pervasive degeneracy in such problems. This generalized alternating path algorithm is based on the characterization of a special subset of the bases that are capable of leading to an optimal solution. With consideration restricted to these bases, fewer alternative representations of a given extreme point are inspected. The impact on the number of degenerate pivots and problem solution times is demonstrated by computational testing and comparison with other approaches. Author

Descriptors:

• *NETWORK ANALYSIS(MANAGEMENT)
• *SHIPPING
• *SIMPLEX METHOD
• ALGORITHMS
• OPTIMIZATION
• PLANNING
• DECISION THEORY
• COMBINATORIAL ANALYSIS

Subject Categories:

• Administration and Management
• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE