A constraint logic programming algorithm for modeling dynamic pricing.

Oliveira, Fernando S.

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.

Citation

OLIVEIRA, F.S. 2008. A constraint logic programming algorithm for modeling dynamic pricing. INFORMS journal on computing [online], 20(1), pages 69-77. Available from: https://doi.org/10.1287/ijoc.1060.0218

• Journal Article Type: Article
• Acceptance Date: Dec 1, 2006
• Online Publication Date: Feb 1, 2008
• Publication Date: Mar 31, 2008
• Deposit Date: Oct 21, 2023
• Publicly Available Date: Nov 15, 2023
• Journal: INFORMS journal on computing
• Print ISSN: 1091-9856
• Electronic ISSN: 1526-5528
• Publisher: INFORMS
• Peer Reviewed: Peer Reviewed
• Volume: 20
• Issue: 1
• Pages: 69-77
• DOI: https://doi.org/10.1287/ijoc.1060.0218
• Keywords: Market modelling; Financial modelling; Dynamic pricing; Resource management; Asset management
• Public URL: https://rgu-repository.worktribe.com/output/2114829