Two stage approach to solve extended transportation problem
Journal: International Journal of Mathematics and Soft Computing (Vol.6, No. 2)Publication Date: 2016.07.24
Authors : Vinayak K Gedam; Mahamad Banekhan Pathan;
Page : 111-119
Keywords : Data Envelopment Analysis (DEA); Decision Making Unit (DMU); Relative Efficiency; Transportation Problem (TP).;
Abstract
The main objective of transportation problem is to minimise the cost of shipping homogeneous commodity from various origins to various destinations. The classical transportation problem is extended by considering multiple incommensurate inputs and outputs for each shipment link. The relative efficiency concept is defined for each possible shipment link. Two linear programming models are proposed to determine the optimal transportation plan with maximum efficiency. A numerical example is discussed to show the applicability of said approach.
Other Latest Articles
- Some extremal problems in (d,d+1)-regular graphs
- Upper vertex covering number and well covered semigraphs
- Infinite multi-series arising from generalized q-alpha difference equation
- Recurrence relation on the number of spanning trees of generalized book graphs and related family of graphs
- Cordial labeling in the context of Duplication of some graph elements
Last modified: 2017-08-30 01:52:39