article · INFORMS journal on computing · 2007

A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing

Cited by 7Open access

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.

Cite this paper

APA 7

Oliveira, F. S. (2007). A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing. INFORMS journal on computing, 20(1), 69–77. https://doi.org/10.1287/ijoc.1060.0218

MLA 9

Oliveira, Fernando S. “A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing.” INFORMS journal on computing, vol. 20, no. 1, 2007, pp. 69–77, https://doi.org/10.1287/ijoc.1060.0218.

Chicago

Oliveira, Fernando S. 2007. “A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing.” INFORMS journal on computing 20 (1): 69–77. https://doi.org/10.1287/ijoc.1060.0218.

Harvard

Oliveira, F.S. (2007) ‘A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing’, INFORMS journal on computing, 20(1), pp. 69–77. Available at: https://doi.org/10.1287/ijoc.1060.0218.

BibTeX

@article{oliveira2007constraint,
  title = {{A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing}},
  author = {Oliveira, Fernando S.},
  journal = {INFORMS journal on computing},
  volume = {20},
  number = {1},
  pages = {69--77},
  year = {2007},
  doi = {10.1287/ijoc.1060.0218}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.