Advertisement

Optimizing a Retail Promotional Calendar by Mixed Integer, Linear Programming

  • Stephen A. Smith
Part of the Applied Optimization book series (APOP, volume 16)

Abstract

This paper formulates a linear programming model for determining an optimal promotional calendar for retail seasonal planning. The objective is to maximize the total season profit, subject to given resource constraints and seasonal variations, by selecting from a finite set of possible promotion policies that can be used each week.

Keywords

Linear Programming Model Safety Stock Price Response Unit Sale Sales Target 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Achabal, S. McIntyre, and S. Smith, 1990, Maximizing Profits from Department Store Promotions, Journal of Retailing, 66, 383 - 407.Google Scholar
  2. [2]
    R. C. Blattberg and S. A. Neslin, 1990, Sales Promotion: Concepts, Methods and Strategies, Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
  3. [3]
    F. Glover and E. Woolsey, 1974, Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program, Operations Research, 22, 180 - 200.CrossRefGoogle Scholar
  4. [4]
    D. M. Hanssens, L. Parsons, and R. Schultz, 1990, Market Response Models: Econometric and Time Series Analysis, Kluwer Academic Publishers, Boston, MA.Google Scholar
  5. [5]
    K. Kalyanam, 1996, Pricing Decisions Under Demand Uncertainty: A Bayesian Mixture Model Approach, Marketing Science, 15, 207 - 221.CrossRefGoogle Scholar
  6. [6]
    S. A. Smith, D. Achabal, and S. McIntyre, 1994, A Two Stage Sales Forecasting Procedure Using Discounted Least Squares, Journal of Marketing Research, 31, 44 - 56.CrossRefGoogle Scholar
  7. [7]
    S. A. Smith, R. Collins, and S. H. McIntyre, 1996, A Discrete Optimization Model for Seasonal Merchandise Planning, Retail Workbench Working Paper W-RW96-01, Santa Clara University.Google Scholar
  8. [8]
    L. J. Watters, 1967 Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems, Operations Research, 15, 1171 - 1194.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Stephen A. Smith
    • 1
  1. 1.University of Santa ClaraSanta ClaraUSA

Personalised recommendations