An Optimum Budget Allocation Model for Dynamic, Interacting Market Segments

This paper formulates a model for determining the optimal allocation of a given advertising budget over M interacting market segments and a time domain of T periods. Guidance for budget size optimization is provided via a shadow price. The basic input parameters are in terms of sales saturation leve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Management science 1973-10, Vol.20 (2), p.179-190
Hauptverfasser: Gensch, Dennis H, Welam, Ulf Peter
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 190
container_issue 2
container_start_page 179
container_title Management science
container_volume 20
creator Gensch, Dennis H
Welam, Ulf Peter
description This paper formulates a model for determining the optimal allocation of a given advertising budget over M interacting market segments and a time domain of T periods. Guidance for budget size optimization is provided via a shadow price. The basic input parameters are in terms of sales saturation levels and advertising elasticities, concepts experienced advertising executives understand and are willing to estimate. Economic and political developments in Western Europe are increasing the interactions among geographically defined segments, and recent development in discrimination techniques may soon make market segmentation a practical strategy for the United States market. In relation to the time domain, the simplistic and often unrealistic constraint of a constant carryover effect is relaxed in that current advertising is hypothesized to generate sales both by creating new customers and by interacting with the residual effects of past advertising (goodwill) thus reinforcing preferences of past customers. This interactive formulation relating past and future expenditures allows a model user greater flexibility in specifying the relationship between advertising and sales. The mathematical programming technique used is a form of convex programming.
doi_str_mv 10.1287/mnsc.20.2.179
format Article
fullrecord <record><control><sourceid>jstor_cross</sourceid><recordid>TN_cdi_jstor_primary_2629805</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>2629805</jstor_id><sourcerecordid>2629805</sourcerecordid><originalsourceid>FETCH-LOGICAL-c362t-e7305e1ecfe742d2a9ef0995daf31c3f4b371122f0d42dfce447f70103b51b443</originalsourceid><addsrcrecordid>eNqFkc2PFCEQxTtGE8ddj948dPTgZXssoGma47h-7Vf2oJ4JQ8MM4wC9wGjmv5e23fVkPFQqqferB3lVVS8QLBHu2Vvnk1piWOIlYvxRtUAUdw2lgB5XCwBMG8SBP62epbQDANazblFdrXx9O2brDq5-dxg2Oter_T4omW3w9U0Y9L42Idbvj146q87qC591lCpbv6lvZPxeFr7ojdM-p9PqiZH7pJ__6SfVt48fvp5_bq5vP12cr64bRTqcG80IUI20Mpq1eMCSawOc00EaghQx7ZowhDA2MBTZKN22zDBAQNYUrduWnFSvZt8xhruDTlnswiH68qTAQHtMO94V6PW_IIQ56wF1fLJqZkrFkFLURozROhmPAoGYQhVTqMVWYFFCLfzlzEc9avUAW-9C_E3-EEQWmshjKcQZKc1Os1LjNGJclDOIbXbF7OVstks5xAcz3GHeAy3y2SxbXy7g0n-_9mbGt3az_WmjFvd7ThbQ_iV_AbZFqIY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>205825696</pqid></control><display><type>article</type><title>An Optimum Budget Allocation Model for Dynamic, Interacting Market Segments</title><source>RePEc</source><source>INFORMS PubsOnLine</source><source>Periodicals Index Online</source><source>EBSCOhost Business Source Complete</source><source>JSTOR Archive Collection A-Z Listing</source><creator>Gensch, Dennis H ; Welam, Ulf Peter</creator><creatorcontrib>Gensch, Dennis H ; Welam, Ulf Peter</creatorcontrib><description>This paper formulates a model for determining the optimal allocation of a given advertising budget over M interacting market segments and a time domain of T periods. Guidance for budget size optimization is provided via a shadow price. The basic input parameters are in terms of sales saturation levels and advertising elasticities, concepts experienced advertising executives understand and are willing to estimate. Economic and political developments in Western Europe are increasing the interactions among geographically defined segments, and recent development in discrimination techniques may soon make market segmentation a practical strategy for the United States market. In relation to the time domain, the simplistic and often unrealistic constraint of a constant carryover effect is relaxed in that current advertising is hypothesized to generate sales both by creating new customers and by interacting with the residual effects of past advertising (goodwill) thus reinforcing preferences of past customers. This interactive formulation relating past and future expenditures allows a model user greater flexibility in specifying the relationship between advertising and sales. The mathematical programming technique used is a form of convex programming.</description><identifier>ISSN: 0025-1909</identifier><identifier>EISSN: 1526-5501</identifier><identifier>DOI: 10.1287/mnsc.20.2.179</identifier><identifier>CODEN: MNSCDI</identifier><language>eng</language><publisher>Hanover, MD., etc: INFORMS</publisher><subject>Advertising ; Advertising expenditures ; Advertising rates ; Budget allocation ; Budget constraints ; Capital assets ; Consumer advertising ; Dynamic modeling ; Influence ; Market segmentation ; Market segments ; Marketing ; Mathematical programming ; Profits ; Shadow prices ; Sponsored search ; User modeling</subject><ispartof>Management science, 1973-10, Vol.20 (2), p.179-190</ispartof><rights>Copyright 1973 The Institute of Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences Oct 1973</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c362t-e7305e1ecfe742d2a9ef0995daf31c3f4b371122f0d42dfce447f70103b51b443</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/2629805$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/mnsc.20.2.179$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,780,784,803,3692,4008,27869,27924,27925,58017,58250,62616</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/inmormnsc/v_3a20_3ay_3a1973_3ai_3a2_3ap_3a179-190.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Gensch, Dennis H</creatorcontrib><creatorcontrib>Welam, Ulf Peter</creatorcontrib><title>An Optimum Budget Allocation Model for Dynamic, Interacting Market Segments</title><title>Management science</title><description>This paper formulates a model for determining the optimal allocation of a given advertising budget over M interacting market segments and a time domain of T periods. Guidance for budget size optimization is provided via a shadow price. The basic input parameters are in terms of sales saturation levels and advertising elasticities, concepts experienced advertising executives understand and are willing to estimate. Economic and political developments in Western Europe are increasing the interactions among geographically defined segments, and recent development in discrimination techniques may soon make market segmentation a practical strategy for the United States market. In relation to the time domain, the simplistic and often unrealistic constraint of a constant carryover effect is relaxed in that current advertising is hypothesized to generate sales both by creating new customers and by interacting with the residual effects of past advertising (goodwill) thus reinforcing preferences of past customers. This interactive formulation relating past and future expenditures allows a model user greater flexibility in specifying the relationship between advertising and sales. The mathematical programming technique used is a form of convex programming.</description><subject>Advertising</subject><subject>Advertising expenditures</subject><subject>Advertising rates</subject><subject>Budget allocation</subject><subject>Budget constraints</subject><subject>Capital assets</subject><subject>Consumer advertising</subject><subject>Dynamic modeling</subject><subject>Influence</subject><subject>Market segmentation</subject><subject>Market segments</subject><subject>Marketing</subject><subject>Mathematical programming</subject><subject>Profits</subject><subject>Shadow prices</subject><subject>Sponsored search</subject><subject>User modeling</subject><issn>0025-1909</issn><issn>1526-5501</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1973</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><sourceid>K30</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqFkc2PFCEQxTtGE8ddj948dPTgZXssoGma47h-7Vf2oJ4JQ8MM4wC9wGjmv5e23fVkPFQqqferB3lVVS8QLBHu2Vvnk1piWOIlYvxRtUAUdw2lgB5XCwBMG8SBP62epbQDANazblFdrXx9O2brDq5-dxg2Oter_T4omW3w9U0Y9L42Idbvj146q87qC591lCpbv6lvZPxeFr7ojdM-p9PqiZH7pJ__6SfVt48fvp5_bq5vP12cr64bRTqcG80IUI20Mpq1eMCSawOc00EaghQx7ZowhDA2MBTZKN22zDBAQNYUrduWnFSvZt8xhruDTlnswiH68qTAQHtMO94V6PW_IIQ56wF1fLJqZkrFkFLURozROhmPAoGYQhVTqMVWYFFCLfzlzEc9avUAW-9C_E3-EEQWmshjKcQZKc1Os1LjNGJclDOIbXbF7OVstks5xAcz3GHeAy3y2SxbXy7g0n-_9mbGt3az_WmjFvd7ThbQ_iV_AbZFqIY</recordid><startdate>19731001</startdate><enddate>19731001</enddate><creator>Gensch, Dennis H</creator><creator>Welam, Ulf Peter</creator><general>INFORMS</general><general>Institute of Management Sciences</general><general>Institute for Operations Research and the Management Sciences</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope><scope>SAAPM</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>M0A</scope><scope>M0C</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>19731001</creationdate><title>An Optimum Budget Allocation Model for Dynamic, Interacting Market Segments</title><author>Gensch, Dennis H ; Welam, Ulf Peter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c362t-e7305e1ecfe742d2a9ef0995daf31c3f4b371122f0d42dfce447f70103b51b443</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1973</creationdate><topic>Advertising</topic><topic>Advertising expenditures</topic><topic>Advertising rates</topic><topic>Budget allocation</topic><topic>Budget constraints</topic><topic>Capital assets</topic><topic>Consumer advertising</topic><topic>Dynamic modeling</topic><topic>Influence</topic><topic>Market segmentation</topic><topic>Market segments</topic><topic>Marketing</topic><topic>Mathematical programming</topic><topic>Profits</topic><topic>Shadow prices</topic><topic>Sponsored search</topic><topic>User modeling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gensch, Dennis H</creatorcontrib><creatorcontrib>Welam, Ulf Peter</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access &amp; Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access &amp; Build (Plan A) - APAC</collection><collection>Primary Sources Access &amp; Build (Plan A) - Canada</collection><collection>Primary Sources Access &amp; Build (Plan A) - West</collection><collection>Primary Sources Access &amp; Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access &amp; Build (Plan A) - Midwest</collection><collection>Primary Sources Access &amp; Build (Plan A) - North Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - Northeast</collection><collection>Primary Sources Access &amp; Build (Plan A) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><collection>Periodicals Index Online Segment 42</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>ABI/INFORM Global</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Management science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gensch, Dennis H</au><au>Welam, Ulf Peter</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Optimum Budget Allocation Model for Dynamic, Interacting Market Segments</atitle><jtitle>Management science</jtitle><date>1973-10-01</date><risdate>1973</risdate><volume>20</volume><issue>2</issue><spage>179</spage><epage>190</epage><pages>179-190</pages><issn>0025-1909</issn><eissn>1526-5501</eissn><coden>MNSCDI</coden><abstract>This paper formulates a model for determining the optimal allocation of a given advertising budget over M interacting market segments and a time domain of T periods. Guidance for budget size optimization is provided via a shadow price. The basic input parameters are in terms of sales saturation levels and advertising elasticities, concepts experienced advertising executives understand and are willing to estimate. Economic and political developments in Western Europe are increasing the interactions among geographically defined segments, and recent development in discrimination techniques may soon make market segmentation a practical strategy for the United States market. In relation to the time domain, the simplistic and often unrealistic constraint of a constant carryover effect is relaxed in that current advertising is hypothesized to generate sales both by creating new customers and by interacting with the residual effects of past advertising (goodwill) thus reinforcing preferences of past customers. This interactive formulation relating past and future expenditures allows a model user greater flexibility in specifying the relationship between advertising and sales. The mathematical programming technique used is a form of convex programming.</abstract><cop>Hanover, MD., etc</cop><pub>INFORMS</pub><doi>10.1287/mnsc.20.2.179</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0025-1909
ispartof Management science, 1973-10, Vol.20 (2), p.179-190
issn 0025-1909
1526-5501
language eng
recordid cdi_jstor_primary_2629805
source RePEc; INFORMS PubsOnLine; Periodicals Index Online; EBSCOhost Business Source Complete; JSTOR Archive Collection A-Z Listing
subjects Advertising
Advertising expenditures
Advertising rates
Budget allocation
Budget constraints
Capital assets
Consumer advertising
Dynamic modeling
Influence
Market segmentation
Market segments
Marketing
Mathematical programming
Profits
Shadow prices
Sponsored search
User modeling
title An Optimum Budget Allocation Model for Dynamic, Interacting Market Segments
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T12%3A03%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Optimum%20Budget%20Allocation%20Model%20for%20Dynamic,%20Interacting%20Market%20Segments&rft.jtitle=Management%20science&rft.au=Gensch,%20Dennis%20H&rft.date=1973-10-01&rft.volume=20&rft.issue=2&rft.spage=179&rft.epage=190&rft.pages=179-190&rft.issn=0025-1909&rft.eissn=1526-5501&rft.coden=MNSCDI&rft_id=info:doi/10.1287/mnsc.20.2.179&rft_dat=%3Cjstor_cross%3E2629805%3C/jstor_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=205825696&rft_id=info:pmid/&rft_jstor_id=2629805&rfr_iscdi=true