An Interior Point Algorithm for Solving Linear Optimization Over the Efficient Set Problems

[[abstract]]The efficient set of a multiple objective linear programming problem is usually nonconvex, hence linear optimization over the efficient set problem is classified as a nonlinear optimization problem. This paper presents a modified interior point algorithm for solving linear optimization over the efficient set problems. Using computational experiments, we show that the modified algorithm provides an effective and accurate approach for solving the linear optimization over the efficient set problem.[[fileno]]2020401010020[[department]]工工