Nguyen Thi Bach Kim

Abstract

        We propose an outer approximation algorithm for constructing a simple efficiency equivalent polyhedron for the feasible set of the multiple objective linear programming problem in the case where the ordering cone induced by the criteria functions is pointed and has a nonempty interior