Dual bounds of a service level assignment problem with applications to efficient pricing

J. Michael Pavlin

European Journal of Operational Research, 2017, vol. 262, issue 1, 239-250

Abstract: We extend the classical continuous assignment problem to allow for the assignment of multiple service levels. This formulation encompasses an important class of lead-time allocation problems in queues where congestion may impact feasible assignments of customers to service levels. Through analysis of the dual program we show a number of results which include existence of welfare maximizing prices for a more general set of operational settings than previously reported. Further, we show that the duality gap provides a bound on welfare loss that can be calculated from operational information in a service system with priced service levels. For systems where total expected delay is a convex function of the customer arrival rate, this bound is shown to be an upper bound on the difference between current and maximum welfare and provide a sufficient condition for maximizing welfare. We demonstrate how this bound may be used to evaluate and improve a current set of prices through use as a measure to guide an adaptive pricing algorithm. The adaptive pricing algorithm is shown through computational experiments to find pricing schemes which deliver near optimal welfare.

Keywords: Service pricing; Assignment; Revenue management; Priority queue; Adaptive pricing (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717303090
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:262:y:2017:i:1:p:239-250

DOI: 10.1016/j.ejor.2017.03.078

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().