z-logo
Premium
Optimal control of a revenue management system with dynamic pricing facing linear demand
Author(s) -
Chou FeeSeng,
Parlar Mahmut
Publication year - 2006
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.785
Subject(s) - optimal control , mathematical optimization , maximum principle , dynamic programming , mathematics , pontryagin's minimum principle , product (mathematics) , optimal decision , sequence (biology) , optimization problem , total revenue , time horizon , dynamic pricing , linear complementarity problem , decision problem , linear programming , revenue , computer science , economics , algorithm , genetics , geometry , accounting , physics , nonlinear system , quantum mechanics , artificial intelligence , biology , microeconomics , decision tree
This paper considers a dynamic pricing problem over a finite horizon where demand for a product is a time‐varying linear function of price. It is assumed that at the start of the horizon there is a fixed amount of the product available. The decision problem is to determine the optimal price at each time period in order to maximize the total revenue generated from the sale of the product. In order to obtain structural results we formulate the decision problem as an optimal control problem and solve it using Pontryagin's principle. For those problems which are not easily solvable when formulated as an optimal control problem, we present a simple convergent algorithm based on Pontryagin's principle that involves solving a sequence of very small quadratic programming (QP) problems. We also consider the case where the initial inventory of the product is a decision variable. We then analyse the two‐product version of the problem where the linear demand functions are defined in the sense of Bertrand and we again solve the problem using Pontryagin's principle. A special case of the optimal control problem is solved by transforming it into a linear complementarity problem. For the two‐product problem we again present a simple algorithm that involves solving a sequence of small QP problems and also consider the case where the initial inventory levels are decision variables. Copyright © 2006 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here