Please use this identifier to cite or link to this item: http://dspace.aiub.edu:8080/jspui/handle/123456789/169
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBabu, Md. Ashraful-
dc.contributor.authorAhmmed, Md. Mortuza-
dc.contributor.authorSalim, Zahir Rayhan-
dc.contributor.authorBabu, Md. Shohel-
dc.contributor.authorHoque, Mohammad Abdul-
dc.date.accessioned2021-10-25T06:59:16Z-
dc.date.available2021-10-25T06:59:16Z-
dc.date.issued2020-04-
dc.identifier.citationBabu, M. A., Ahmmed, M. M., Salim, Z. R., Babu, M. S., & Abdul, M. A Brief Overview of the Classical Transportation Problem.en_US
dc.identifier.issn1006-793-
dc.identifier.urihttp://dspace.aiub.edu:8080/jspui/handle/123456789/169-
dc.description.abstractThe classical transportation problem (TP) is a distribution problem where commodities are transferred from many sources to many destinations with a least total cost. Also, TP considered as one of the classification of a linear programming (LP) problem, and it has a great alliance to inaugurate the linear program and its solution procedure. The variations of classical TP generally depend on the supply and demand constraints. The effectiveness of the algorithm for solving TP is determined by the closeness to the least cost solution to the TP. In this paper, the existence of solution to the TP, the basic theorems of classical TP, are stated and proven in a new manner. Also, an analysis has been performed to indicate the limitations of the existing solution procedures. Finally, the necessary and sufficient conditions are carried out for the optimality to the TP.en_US
dc.language.isoenen_US
dc.publisherXi'an University of Architecture & Technologyen_US
dc.subjectInitial Feasible Solution, MODI, Optimal Solution, Transportation Problem, SSM, VAMen_US
dc.titleA Brief Overview of the Classical Transportation Problemen_US
dc.typeArticleen_US
Appears in Collections:Publication: Journal

Files in This Item:
File Description SizeFormat 
Abstract.docx3.54 MBMicrosoft Word XMLView/Open


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