| Article ID: | iaor20084148 |
| Country: | United Kingdom |
| Volume: | 17 |
| Issue: | 1 |
| Start Page Number: | 39 |
| End Page Number: | 50 |
| Publication Date: | Jan 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Ringuest Jeffrey L., Haksever Cengiz |
| Keywords: | programming: linear |
This paper presents an investigation of computational considerations that are relevant to implementing interactive procedures for solving large scale multiobjective linear programming (MOLP) problems. Four approaches to implementing the simplified interactive multiple objective linear programming (SIMOLP) procedure of Reeves and Franz are compared. Statistics on the number of simplex iterations and CPU time required for each approach arc presented for a set of 75 randomly generated problems. The results suggest several techniques that may be applicable to interactive algorithms in general. Significant, systematic reductions in the computational requirements are obtained for a wide variety of test problems.