IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/vmt-1y1960i2p94-100.html
   My bibliography  Save this article

Planning Advertising Expenditures by Dynamic Programming Methods

Author

Listed:
  • Richard B. Maffei

    (School of Industrial Management, Massachusetts Institute of Technology)

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.

Suggested Citation

  • Richard B. Maffei, 1960. "Planning Advertising Expenditures by Dynamic Programming Methods," Management Science, INFORMS, vol. 0(2), pages 94-100, December.
    • Handle: RePEc:inm:ormnsc:v:mt-1:y:1960:i:2:p:94-100
    DOI: 10.1287/mantech.1.2.94
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mantech.1.2.94
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mantech.1.2.94?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:mt-1:y:1960:i:2:p:94-100. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.