Abstract
The transportation model is a special case of linear programming models, widely used in the areas of inventory control, employment scheduling, aggregate planning, and personnel assignment, among others. Due to its special structure, the stepping-stone method is commonly adopted in order to improve the computational efficiency instead of the regular simplex method. This paper proposes a new approach, the dual-matrix approach to solve the transportation problem. The dual-matrix approach is very efficient in terms of computation. The algorithm of this approach is presented, and explained briefly as the regular simplex method and the stepping-stone method. Finally, a numerical example is described in the paper to show its efficiency.
| Original language | English |
|---|---|
| Pages (from-to) | 35-45 |
| Number of pages | 11 |
| Journal | Asia-Pacific Journal of Operational Research |
| Volume | 19 |
| Issue number | 1 |
| Publication status | Published - 1 May 2002 |
Keywords
- Dual-matrix approach
- Linear programming models
- Simplex method
- Stepping-stone method
- Transportation problem
ASJC Scopus subject areas
- Management Science and Operations Research