On the Modified Interior Point Algorithm for Solving Multi-Objective Linear Programming Problems

摘要

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 analyzed and compared.