A primal|dual infeasible|interior|point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm, moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.
展开▼
