Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model

IF 0.9 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Chenhao Wang, Yao Wang, Shaojie Tang
{"title":"Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model","authors":"Chenhao Wang, Yao Wang, Shaojie Tang","doi":"10.1007/s10878-024-01257-0","DOIUrl":null,"url":null,"abstract":"<p>Despite the assortment optimization problem has been widely studied in the past decades, the interplay between advertising and its implications for this issue remains under-explored. This study seeks to bridge this research gap by tackling the combined challenge of advertising and assortment optimization. We assume that advertising can increase the awareness of specific products, and the magnitude of this effect is jointly depends on the product-specific effectiveness of advertising and the allocated advertising budget. For this joint problem, our objective is to maximize the expected revenue by finding the optimal advertising strategy and the displayed assortment. In this work, we analyze the structure of this problem and propose efficient approaches to solve it across different scenarios. In the unconstrained setting, we demonstrate that the optimal assortment includes products whose revenue exceeds a certain threshold. When there is a cardinality constraint for the assortment, we consider a relaxed problem and propose an efficient method to identify a near-optimal solution. We also examine the joint assortment, pricing, and advertising problem in both unconstrained and cardinality-constrained settings, incorporating the fairness constraint for the advertising strategy and extending our findings to account for consumer sequential decision-making patterns. Through a series of numerical tests, we confirm the validity of our methods and demonstrate that they outperform existing heuristic approaches.\n</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"32 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01257-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Despite the assortment optimization problem has been widely studied in the past decades, the interplay between advertising and its implications for this issue remains under-explored. This study seeks to bridge this research gap by tackling the combined challenge of advertising and assortment optimization. We assume that advertising can increase the awareness of specific products, and the magnitude of this effect is jointly depends on the product-specific effectiveness of advertising and the allocated advertising budget. For this joint problem, our objective is to maximize the expected revenue by finding the optimal advertising strategy and the displayed assortment. In this work, we analyze the structure of this problem and propose efficient approaches to solve it across different scenarios. In the unconstrained setting, we demonstrate that the optimal assortment includes products whose revenue exceeds a certain threshold. When there is a cardinality constraint for the assortment, we consider a relaxed problem and propose an efficient method to identify a near-optimal solution. We also examine the joint assortment, pricing, and advertising problem in both unconstrained and cardinality-constrained settings, incorporating the fairness constraint for the advertising strategy and extending our findings to account for consumer sequential decision-making patterns. Through a series of numerical tests, we confirm the validity of our methods and demonstrate that they outperform existing heuristic approaches.

广告满足分类规划:多项逻辑模型下的联合广告与分类优化
尽管在过去的几十年里,分类优化问题已经得到了广泛的研究,但广告及其对这一问题的影响之间的相互作用仍然没有得到充分的探讨。本研究旨在通过解决广告和分类优化的综合挑战来弥合这一研究差距。我们假设广告可以提高特定产品的认知度,而这种效果的大小共同取决于广告对特定产品的有效性和分配的广告预算。对于这个联合问题,我们的目标是通过找到最优的广告策略和显示分类来最大化预期收益。在这项工作中,我们分析了这个问题的结构,并提出了在不同场景下解决这个问题的有效方法。在无约束的情况下,我们证明了最优分类包括收益超过某一阈值的产品。当分类存在基数约束时,我们考虑一个松弛问题,并提出了一种有效的方法来识别近最优解。我们还研究了在无约束和基数约束两种情况下的联合分类、定价和广告问题,将公平约束纳入广告策略,并将我们的发现扩展到考虑消费者顺序决策模式。通过一系列的数值测试,我们证实了我们的方法的有效性,并证明它们优于现有的启发式方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信