Journal article
A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization
Operations research, v 20(1), pp 109-125
Feb 1972
Abstract
Some transportation problems are such that, when origins and destinations are suitably indexed, the cost matrix contains elements along the main diagonal, a band above it, and a band below it, while the other elements of the cost matrix are infinite. We present here a procedure that yields optimal solution to such tridiagonal problems in n steps for an n-origin, n-destination problem. We also suggest a method for solving any other model that is “close” to a tridiagonal one by Bender's Algorithm. The algorithm presented here works by eliminating all off-diagonal variables in terms of the diagonal ones, and then specifying values for the diagonal variables. The extension with Bender's Algorithm involves solution of a sequence of tridiagonal models and small linear programming problems.
Metrics
Details
- Title
- A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization
- Creators
- Benjamin Lev - Temple University
- Publication Details
- Operations research, v 20(1), pp 109-125
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Decision Sciences (and Management Information Systems)
- Web of Science ID
- WOS:A1972L962800011
- Scopus ID
- 2-s2.0-0015281241
- Other Identifier
- 991019238626504721