Using Lexicographic Parametric Programming for Searching a Non-dominated Set in Multiple-Objective Linear Programming

In this paper we propose an approach which makes it possible to search non-dominated and only non-dominated solutions in multiple-objective linear programming. The approach is based on the use of a reference direction and lexicographic parametric programming. The requisite theory is developed in the paper. The use of the approach is illustrated with a numerical example.