UM  > Faculty of Business Administration
Residential Collegefalse
Status已發表Published
Joint promotional effort and assortment optimization under the multinomial logit model
Xiao, Hua1; Gong, Min2; Lian, Zhaotong3; Nip, Kameng4
2024
Source PublicationNaval Research Logistics
ABS Journal Level3
ISSN0894-069X
Abstract

Promotional effort is a common strategy to induce sales and broaden the market scope by enhancing the products' utility to customers. In this article, we incorporate promotional effort into the customer choice model and study the joint promotional effort and assortment optimization problems, where the customer's choice behavior follows the widely used multinomial-logit (MNL) model. Motivated by various marketing scenarios, we introduce two distinct models that address the allocation of promotional effort: (1) differentiated promotional effort—the retailer can arbitrarily allocate promotional resources to each offered product; (2) uniform promotional effort—the retailer can determine a promotional level, and the promotional effort is equally distributed to each offered product. In the first model, the revenue-ordered assortment strategy is optimal, and we can efficiently determine the optimal promotional effort level. In the second model, the revenue-ordered assortment is no longer optimal. We develop a polynomial time algorithm to solve the joint optimization problem under this model. Using the algorithmic results, we conduct comparative analyses between the assortment optimization problem under the proposed models and the classic MNL model, which does not exert any promotional effort. We show that the assortment size shrinks when the retailer makes the promotional effort in the decision, which indicates that product variety and promotional effort are strategic substitutes. Moreover, the retailer and customers can be better off in the presence of promotional efforts, irrespective of the format. Additionally, we conduct extensive numerical experiments to demonstrate our analytical results and gain more managerial insights.

KeywordAssortment Optimization Multinomial Logit Model Promotional Effort Revenue Management
DOI10.1002/nav.22187
URLView the original
Indexed BySCIE
Language英語English
WOS Research AreaOperations Research & Management Science
WOS SubjectOperations Research & Management Science
WOS IDWOS:001198563600001
PublisherWILEY, 111 RIVER ST, HOBOKEN 07030-5774, NJ
Scopus ID2-s2.0-85190433629
Fulltext Access
Citation statistics
Document TypeJournal article
CollectionFaculty of Business Administration
DEPARTMENT OF ACCOUNTING AND INFORMATION MANAGEMENT
Corresponding AuthorNip, Kameng
Affiliation1.Faculty of Business, City University of Macau, SAR, Macao
2.College of Information Science and Technology, Jinan University, Guangzhou, China
3.Faculty of Business Administration, University of Macau, SAR, Macao
4.College of Management, Shenzhen University, Shenzhen, China
First Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Xiao, Hua,Gong, Min,Lian, Zhaotong,et al. Joint promotional effort and assortment optimization under the multinomial logit model[J]. Naval Research Logistics, 2024.
APA Xiao, Hua., Gong, Min., Lian, Zhaotong., & Nip, Kameng (2024). Joint promotional effort and assortment optimization under the multinomial logit model. Naval Research Logistics.
MLA Xiao, Hua,et al."Joint promotional effort and assortment optimization under the multinomial logit model".Naval Research Logistics (2024).
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xiao, Hua]'s Articles
[Gong, Min]'s Articles
[Lian, Zhaotong]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xiao, Hua]'s Articles
[Gong, Min]'s Articles
[Lian, Zhaotong]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xiao, Hua]'s Articles
[Gong, Min]'s Articles
[Lian, Zhaotong]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.