Optimal selection of media vehicles using customer databases

作者:

Highlights:

摘要

This paper investigates the problem where an organization must select among multiple media vehicles for a marketing campaign, and determine how many names from each vehicle to impress (the contact depth). The organization can estimate the return from contacting each prospective customer, and this return decreases as depth increases. Different vehicles have different marginal costs per impression, and may have minimum-spend requirements or activation costs to use the vehicle. Decisions are to be made to maximize profit subject to a constraint on the total amount spent. We proposed an optimization model and two computationally efficient methods that often lead to global optimal solutions under practical assumptions. The model is illustrated with two data sets.

论文关键词:Optimization,Advertising,Media vehicle,Depth of purchase,Revenue-to-cost ratio,Internet marketing,Mailing list,Dynamic programing

论文评审过程:Available online 20 June 2012.

论文官网地址:https://doi.org/10.1016/j.eswa.2012.05.095