Application and comparison of three multiobjective linear programming methods

Please use this identifier to cite or link to this item: http://ir.library.ui.edu.ng/handle/123456789/1944

Full metadata record

DC Field	Value	Language
dc.contributor.author	Adeyeye, A. D	-
dc.contributor.author	Charles-Owaba, O. E.	-
dc.date.accessioned	2018-10-11T09:16:21Z	-
dc.date.available	2018-10-11T09:16:21Z	-
dc.date.issued	2011	-
dc.identifier.issn	2225-0581	-
dc.identifier.issn	Industrial Engineering Letters 10(10), pp.1-12	-
dc.identifier.other	ui_art_adeyeye_application_2011	-
dc.identifier.uri	http://ir.library.ui.edu.ng/handle/123456789/1944	-
dc.description.abstract	A biobjective production planning problem was modelled using the Compromise Constraint Biobjective LP (CCBLP) method, the traditional Weighted-sum Scalarization (WSS) and Non-preemptive Goal Programming (NGP) approaches. Various preference indices were used to explore the tradeoff options and the L1 distance metric was used to determine the best compromise solution and the appropriate preference indices. The solution of CCBLP was the closest to the ideal solution with L1 metric of 0.326 and corresponding preference indices of W1 = 0.25, W2 = 0.75. Comparison of the results showed that the CCBLP is more sensitive to changes in preference indices than the WSS and NGP methods and hence it is more useful in helping the decision maker to make intelligent tradeoff decisions	en_US
dc.language.iso	en	en_US
dc.publisher	International Knowledge Sharing Platform(IISTE)	en_US
dc.title	Application and comparison of three multiobjective linear programming methods	en_US
dc.type	Article	en_US
Appears in Collections:	scholarly works

Files in This Item:

File	Description	Size	Format
(1)ui_art_adeyeye_application_2011.pdf		1.43 MB	Adobe PDF	View/Open

UISpace