Article thumbnail
Location of Repository

A constraint logic programming algorithm for modeling dynamic pricing

By Fernando Oliveira

Abstract

We extend Lemke's algorithm to solve a dynamic pricing problem. We identify an instance in which Lemke's algorithm fails to converge to an optimal solution (when an optimum does exist) and propose a constraint logic programming solution to this problem. We analyze the complexity of the extended Lemke's algorithm. Our analysis shows that, in the short term, dynamic pricing can be used to improve resource management efficiency. It is also shown that dynamic pricing can be used to manage the long-term behavior of demand

Topics: QA76, HD28
Publisher: Institute for Operations Research and the Management Sciences (I N F O R M S)
Year: 2008
DOI identifier: 10.1287/ijoc.1060.0218
OAI identifier: oai:wrap.warwick.ac.uk:30378
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://dx.doi.org/10.1287/ijoc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.