| Article ID: | iaor19932413 |
| Country: | United Kingdom |
| Volume: | 43 |
| Issue: | 12 |
| Start Page Number: | 1179 |
| End Page Number: | 1181 |
| Publication Date: | Dec 1992 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Ringuest J.L., Haksever C. |
| Keywords: | computational analysis |
This paper presents the results of an investigation into computational considerations that are relevant to large-scale multiobjective linear programming (MOLP) problems. Four approaches to obtaining a representation of the ideal solution are compared. Statistics on the number of simplex iterations and CPU time required are analysed for a set of randomly generated multiobjective linear programming problems. Recommendations are made based on the analysis of these results which are applicable to many MOLP solution algorithms.