An interior potential push algorithm for solving multiobjective linear programming problems
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 93 === The area of multiobjective linear programming problem (MOLP) has prevailed and attracted a lot of attention for the last thirty years and many approaches or variants were developed to solve these problems. In this thesis, we consider Arbel's algorithm...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65440946689685615147 |
| Summary: | 碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 93 === The area of multiobjective linear programming problem (MOLP) has prevailed and attracted a lot of attention for the last thirty years and many approaches or variants were developed to solve these problems. In this thesis, we consider Arbel's algorithm called Primal-Dual Interior Multiple Objective Linear Programming (PDIMOLP) algorithm that generates search directions pointing toward anchoring points. We use Arbel's algorithm as a foundation and make some modifications by adopting fail-safe technique to find an initial efficient point. Moreover, we adopt potential push method into the modified
algorithm and make some changes in solving nonlinear utility functions that the solution locates at the boundary of the feasible region or inside the feasible region. We make it more effective in solving multiobjective linear programming problems. From the computational results, the proposed modified algorithm performed well to solve the multiobjective linear programming problems.
|
|---|