Planning Advertising Expenditures by Dynamic Programming Methods

Richard B. Maffei
Additional contact information
Richard B. Maffei: School of Industrial Management, Massachusetts Institute of Technology

Management Science, 1960, vol. MT-1, issue 2, 94-100

Abstract: Much of the importance of the new dynamic programming methods has remained unnoticed because of the apparent complexity of the underlying mathematics. This is indeed unfortunate because the essence of the programming methods for certain classes of problems is not new to practicing economists. Dynamic programming methods can provide an efficient computational algorithm for problem types frequently encountered in consumer demand and production theory. In this paper the following approach will be utilized. First, an illustration concerned with the allocation of an advertising budget among competing media will be presented that will enable the reader to study the relationship between dynamic programming and simple combinatorial analysis. Second, an attempt will be made to show the relationship between demand and production theory on the one hand and programming on the other. Third, an advertising budget allocation problem much like the simpler one discussed in the first section will be cast in terms of the dynamic programming computational procedure and solved. Finally, a very brief mathematical solution will be preferred. "Management Technology", ISSN 0542-4917, was published as a separate journal from 1960 to 1964. In 1965 it was merged into Management Science.

Date: 1960
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mantech.1.2.94 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:mt-1:y:1960:i:2:p:94-100

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().