Journal
MANAGEMENT SCIENCE
Volume 55, Issue 10, Pages 1718-1728Publisher
INFORMS
DOI: 10.1287/mnsc.1090.1058
Keywords
branch and price; column generation; combinatorial optimization; conjoint analysis; integer programming; marketing; optimization; product line design; share of choice
Ask authors/readers for more resources
We develop a branch-and-price algorithm for constructing an optimal product line using partworth estimates from choice-based conjoint analysis. The algorithm determines the specific attribute levels for each multiattribute product in a set of products to maximize the resulting product line's share of choice, i.e., the number of respondents for whom at least one new product's utility exceeds the respondent's reservation utility. Computational results using large commercial and simulated data sets demonstrate that the algorithm can identify provably optimal, robust solutions to realistically sized problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available