查詢結果分析
相關文獻
頁籤選單縮合
題 名 | On the Modified Interior Point Algorithm for Solving Multi-Objective Linear Programming Problems |
---|---|
作 者 | Lin, Chin-tsai; Chen, Chie-bein; Chen, Po-ting; | 書刊名 | International Journal of Information and Management Sciences |
卷 期 | 17:1 民95.03 |
頁 次 | 頁107-127 |
分類號 | 494.5 |
關鍵詞 | Multiple objective linear programming problem; MOLP problem; Interior point algorithm; Karmarkar's method; Simplex method; |
語 文 | 英文(English) |
英文摘要 | This study presents a modified interior point algorithm for solving multiple objective linear programming (MOLP) problems. The modified algorithm identifies the local optional solution obtained using existing interior point algorithms. This study also conducts a numerical experiment to solve MOLP problems and to examine optimal objective-value accuracy and computing efficiency (or CPU running time) in different problems using both existing and modified interior point algorithms, as well as the Simplex Method. Finally, the experimental results are analyzd and compared. |
本系統中英文摘要資訊取自各篇刊載內容。