Name
Abstract | ||
|---|---|---|
Consider a situation in which a company sells several different items to a set of customers. However, the company is not satisfied with the current pricing strategy and wishes to implement new prices for its items. Implementing these new prices in one single step might not be desirable, for example, because of the change in contract prices for the customers. Therefore, the company changes the prices gradually, such that the prices charged to a subset of the customers, the target market, do not differ too much from one period to the next. We propose a polynomial time algorithm to implement the new prices in the minimum number of time periods needed, given that the prices charged to the customers in the target market increase by at most a factor 1+@d, for a given @d0. Furthermore, we address the problem of maximizing the overall revenue during the price implementation over a given time horizon. For this problem, we describe a dynamic program for the case of integer price vectors, and a local search algorithm for arbitrary prices. Also, we present a mixed integer programming formulation for this problem and apply our algorithms in a practical study. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.cor.2010.06.010 | Computers & OR |
Keywords | DocType | Volume |
integer price vector,mixed integer programming formulation,local search algorithm,time horizon,arbitrary price,pricing problems,integer linear program,time period,company change,polynomial time algorithm,new price,price strategy implementation,computational complexity,contract price,local search,management science,satisfiability,operations research | Journal | 38 |
Issue | ISSN | Citations |
2 | Computers and Operations Research | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| André Berger | 1 | 10 | 3.08 |
| Alexander Grigoriev | 2 | 203 | 24.23 |
| Joyce Van Loon | 3 | 34 | 4.03 |