Computationally Efficient Methods for Calculating the Ideal Solution for MOLP Problems |
| |
| Authors: | Cengiz Haksever Jeffrey L. Ringuest |
| |
| Affiliation: | 1.Department of Management Sciences,Rider College,USA;2.Department of Operations and Strategic Management,Boston College,USA |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
