Incremental search heuristics do not identify the optimal solution to the media choice problem. With media discounts, such heuristics may not provide even a good approximation. This article discusses the reasons for this situation and considers several supplementary heuristics for improving the quality of solutions.
Get full access to this article
View all access options for this article.
References
1.
AakerDavid A., “A Probabilistic Approach to Industrial Media Selection,” Journal of Advertising Research, 8 (September 1968), 46–54.
2.
BroadbentSimon, “Media Planning and Computers by 1970: A Review of the Use of Mathematical Models in Media Planning,” Applied Statistics, 15 (November 1966), 234–56.
3.
BrownDouglas B., “A Practical Procedure for Media Selection,” Journal of Marketing Research, 4 (August 1967), 262–9.
4.
GenschDennis, “A Computer Simulation Model for Selecting Advertising Schedules,” Journal of Marketing Research, 6 (May 1969), 203–14.
5.
HinkleCharles L. and KuehnAlfred A., “Heuristic Models: Mapping the Maze for Management,” California Management Review, 10 (Fall 1967), 59–68.
6.
KaplanRobert S. and ShockerAllan D., “The Effect of Discounts on the Computation of Optimal Media Plans,” Management Sciences Research Report, No. 164, Pittsburgh: Graduate School of Industrial Administration, Carnegie-Mellon University (June 1, 1969), Journal of Advertising Research (forthcoming).
7.
KuehnAlfred A., “Models for the Budgeting of Advertising,” in LanghoffPeter, ed., Models, Measurement and Marketing, Englewood Cliffs, N. J.: Prentice-Hall, 1965.
8.
KuehnAlfred A., and HamburgerMichael J., “An Heuristic Program for Locating Warehouses,” Management Science, 9 (July 1963), 643–66.
9.
LittleJohn D. C. and LodishLeonard M., “A Media Planning Calculus,” Operations Research, 17 (January–February 1969), 1–35.
10.
MoranWilliam T., “Practical Media Decisions and the Computer,” Journal of Marketing, 27 (July 1963), 26–30.
11.
PierceJohn F., “Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems,” Management Science, 15 (November 1968), 191–209.
12.
WalkerWarren, “Adjacent Extreme Point Algorithms for the Fixed Charge Problem,” Department of Operations Research, Technical Report No. 40, Ithaca, N. Y.: Cornell University (January 30, 1968).
