Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Application and comparison of three multiobjective linear programming methods
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...
Saved in:
| Format: | Article |
|---|---|
| Published: |
2011
|
| Tags: |
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000njm a2000000a 4500 | ||
|---|---|---|---|
| 001 | oai:repository.ui.edu.ng:123456789/1944 | ||
| 042 | |a dc | ||
| 720 | |a Adeyeye, A. D |e author | ||
| 720 | |a Charles-Owaba, O. E. |e author | ||
| 260 | |c 2011 | ||
| 520 | |a 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 | ||
| 024 | 8 | |a 2225-0581 | |
| 024 | 8 | |a Industrial Engineering Letters 10(10), pp.1-12 | |
| 024 | 8 | |a ui_art_adeyeye_application_2011 | |
| 024 | 8 | |a http://ir.library.ui.edu.ng/handle/123456789/1944 | |
| 245 | 0 | 0 | |a Application and comparison of three multiobjective linear programming methods |