A MULTILEVEL TRANSPORTATION PROBLEM WITH PROBLEM WITH MULTIPLE INPUTS AND OUTPUTS

DSpace JSPUI

Learn More

Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/20178

Full metadata record

DC Field	Value	Language
dc.contributor.author	KAUR, JASKIRAT	-
dc.contributor.author	UPADHYAY, NEHA	-
dc.date.accessioned	2023-08-18T06:29:44Z	-
dc.date.available	2023-08-18T06:29:44Z	-
dc.date.issued	2023-05	-
dc.identifier.uri	http://dspace.dtu.ac.in:8080/jspui/handle/repository/20178	-
dc.description.abstract	Proposed modifications to the traditional multilevel transportation problem include multiple incompatible inputs and outputs for each shipping link, along with a definition of relative efficiency for each shipment connection. To determine the optimal transportation method, two linear programming problems are solved, one for direct transportation and the other for multilevel transportation. A numerical example is provided to illustrate the process.	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	TD-6711;	-
dc.subject	TRANSPORTATION PROBLEM	en_US
dc.subject	DATA ENVELOPMENT ANALYSIS (DEA)	en_US
dc.subject	INPUT-OUTPUT	en_US
dc.subject	MULTILEVEL	en_US
dc.title	A MULTILEVEL TRANSPORTATION PROBLEM WITH PROBLEM WITH MULTIPLE INPUTS AND OUTPUTS	en_US
dc.type	Thesis	en_US
Appears in Collections:	M Sc Applied Maths

Files in This Item:

File	Description	Size	Format
Jaskirat and Neha Upadhyay M.Sc.pdf		2.33 MB	Adobe PDF	View/Open