Abstract
The transportation problem is an important network structured linear programming problem that arises in several contexts and that has received a great deal of attention in the literature. The existing transportation problems are limited to consideration unit of shipping cost or profit along an arc. However, in many real applications, various attributes are usually considered in a transportation problem. The current paper, proposes an extension to this problem in the presence of multiple in-commensurate inputs and outputs for each arc. The concept of relative efficiency is defined for each possible transportation plan. Two linear programming models are proposed to determine the transportation plan with the maximum efficiency. A numerical example is used to illustrate the applicability of the approach.
Similar content being viewed by others
References
Banker RD, Charnes A, Cooper WW (1984) Some methods for estimating technical and scale inefficiencies in data envelopment analysis. Manage Sci 30(9): 1078–1092
Bazaraa MS, Jarvis JJ, Shetty HD (1990) Linear programming and network flows, 2nd edn. Wiley, New York
Charnes A, Cooper WW (1962) Programming with linear fractional functions. Naval Res Logist Q 9: 181–186
Charnes A, Cooper WW, Rhodes E (1978) Measuring the efficiency of decision making units. Eur J Oper Res 2(6): 429–444
Chen LH, Lu HW (2007) An extended assignment problem considering multiple inputs and outputs. Appl Math Model 31: 2239–2248
Cooper WW, Seiford LM, Zhu J (2004) Handbook of data envelopment analysis. Kluwer Academic Publishers, Norwell
Cooper WW, Seiford LM, Tone K (2007) Data envelopment analysis: a comprehensive text with models, applications, references and DEA-solver software, 2nd edn. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Amirteimoori, A. An extended transportation problem: a DEA-based approach. Cent Eur J Oper Res 19, 513–521 (2011). https://doi.org/10.1007/s10100-010-0140-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-010-0140-0