Finding efficient faces of production possibility set with variable returns to scale using MOLP

In this paper an algorithm for obtain efficient faces with multiple objective linear programming (MOLP) problem whose feasible region is the production possibility set with variable returns to scale is proposed. The procedure first finds whether an efficient solution exists for a given linear multiple objective program and then determines an initial efficient basic solution. In a second step the set of all efficient units by multicriterion simplex method is established. Finally, the set of all efficient units is constructed as a union of a minimal number of convex sets of efficient units. Therefore, by solving the proposed algorithm, the efficientfaces in TV can be found.

Keywords:

Data envelopment analysis , Multiple objective linear programming , Efficient face