Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy

Pricing under a consumer choice model has been extensively studied in economics and revenue management. In this paper, we tackle a generalization of the Rank Pricing Problem (RPP), a multi-product pricing problem with unit-demand customers and a ranking-based consumer choice model. We generalize the RPP assuming that each product has a limited amount of copies for sale, and we call this extension the Capacitated Rank Pricing Problem (CRPP). We compare the envy-free allocation of the products (a fairness criterion requiring that customers receive their highest-ranked product given the pricing) with the envy version of the problem. Next, we focus on the CRPP with envy. We introduce two integer linear formulations for the CRPP and derive valid inequalities leveraging the structure of the problem. Afterwards, we develop separation procedures for the families of valid inequalities of greater size. The performance of the formulations and the resolution algorithms developed is tested by means of extensive computational experiments. •A generalization of the Rank Pricing Problem adding limited supply of products.•A multi-product pricing problem with a ranking-based consumer choice model.•Two new mixed-integer linear formulations and valid inequalities developed.•Projection of variables using Farkas’ Lemma to obtain valid inequalities.•Resolution schemes with valid inequalities included in a branch-and-cut fashion.