An approach for finding efficient points in multiobjective linear programming

This paper presents a complete procedure for solving Multiple Objective Linear Programming Problems. The approach generates the whole efficient set and all extreme efficient points. The algorithm is based on a new characterization of efficient face incident to a given extreme point and the connectedness property of the set of ideal tableaux associated to a degenerated point to handle degenerated problems. A numerical example is given to illustrate the proposed algorithm.