Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16568
Title: A dual-matrix approach to the transportation problem
Authors: Ji, P 
Chu, KF
Keywords: Dual-matrix approach
Linear programming models
Simplex method
Stepping-stone method
Transportation problem
Issue Date: 2002
Publisher: World Scientific
Source: Asia-pacific journal of operational research, 2002, v. 19, no. 1, p. 35-45 How to cite?
Journal: Asia-Pacific journal of operational research 
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.
URI: http://hdl.handle.net/10397/16568
ISSN: 0217-5959
EISSN: 1793-7019
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
2
Last month
0
Citations as of Sep 17, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Sep 16, 2017

Page view(s)

72
Last Week
6
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.