Accession Number:

AD0749718

Title:

On Solving the Singularly Constrained Transportation Problem.

Descriptive Note:

Research rept.,

Corporate Author:

TEXAS UNIV AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s):

Report Date:

1972-08-01

Pagination or Media Count:

35.0

Abstract:

A primal simplex procedure is developed to solve transportation problems with an arbitrary additional constraint. The approach is a specialization of the Double Reverse Method of Charnes and Cooper. Efficient procedures for pricing-out the basis, determining representations, and implementing the change of basis are presented. These procedures exploit the pure transportation substructure in such a manner that full advantage may be taken of the computational schemes and list structures used to store and update the basis in codifying the Row-Column Sum Method. Furthermore, the pricing-out and change of basis procedures are organized in a manner that permits the calculations for one to be used in the other. Methods for obtaining basic primal feasible starts and good feasible integer solutions are also presented. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE