Accession Number:

AD0763381

Title:

The Singularly Constrained Generalized Network Problem

Descriptive Note:

Research rept.

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s):

Report Date:

1973-02-01

Pagination or Media Count:

21.0

Abstract:

The paper presents a computationally efficient method for solving generalized network problems with an additional linear constraint. The method is basically the primal simplex method specialized to exploit the topological structure of the problem. The method is similar to the specialization of Charnes and Coopers Double Reverse Method by Meier, and Klingman and Russell for constrained pure network problems. It couples the augmented predecessor index method with a double pricing procedure to yield an inverse compactification which reduces the arithmetic calculations required in pivoting. It is also shown how to simplify and accelerate the steps of updating costs and finding basis representations by taking advantage of the quasi- triangularity of a basis.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE