Cost efficiency in data envelopment analysis under the law of one price

• A pair of models are developed to calculate the upper and lower bounds of CE.
• A base-enumerating algorithm is proposed to solve the lower CE models.
• A numerical example is used to illustrate the proposed approaches.

To impose the law of one price (LoOP) restrictions, which state that all firms face the same input prices, Kuosmanen, Cherchye, and Sipiläinen (2006) developed the top-down and bottom-up approaches to maximizing the industry-level cost efficiency. However, the optimal input shadow prices generated by the above approaches need not be unique, which influences the distribution of the efficiency indices at the individual firm level. To solve this problem, in this paper, we developed a pair of two-level mathematical programming models to calculate the upper and lower bounds of cost efficiency for each firm in the case of non-unique LoOP prices while keeping the industry cost efficiency optimal. Furthermore, a base-enumerating algorithm is proposed to solve the lower bound models of the cost efficiency measure, which are bi-level linear programs and NP-hard problems. Lastly, a numerical example is used to demonstrate the proposed approach.