The Chilean State delivers essential meal services at schools for low-income students. Junta Nacional de Auxilio Escolar y Becas, the institution in charge of covering 1,300,000 children, leases the meal service to private enterprises. We developed an integer linear programming model to assign the meal contracts, in a process known as combinatorial auctions. The resulting model, which is NP-hard, led to significant improvements in efficiency and also contributed to making the process more transparent. The results are apparent in substantial improvements in quality and coverage of the service, and important savings to the country, which are equivalent to feeding 300,000 children in addition. We developed techniques to solve the combinatorial models and also to analyze and compare multiple scenarios to find robust solutions. For the objective function of this problem, we analyzed several options to consider different kinds of social benefits. In this paper, we describe the problem, the methodology and the results. We also present empirical results based on 6 years of experience. Finally, we discuss the relevance and impact of using operations research in these central issues in developing countries.
Epstein, Rafael, Lysette Henríquez, Jaime Catalán, Gabriel Weintraub, Cristián Martínez, and F. Espejo. "A combinatorial auction improves school meals in Chile: A case of operations research in developing countries." International Transactions in Operational Research 11, no. 6 (2004): 593-612.
Each author name for a Columbia Business School faculty member is linked to a faculty research page, which lists additional publications by that faculty member.
Each topic is linked to an index of publications on that topic.