Management Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANAGEMENT SCIENCE
Vol. 55, No. 10, October 2009, pp. 1718-1728
DOI: 10.1287/mnsc.1090.1058
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by Wang, X.
Right arrow Articles by Curry, D. J.

A Branch-and-Price Approach to the Share-of-Choice Product Line Design Problem

Xinfang (Jocelyn) Wang, Jeffrey D. Camm, David J. Curry

Department of Finance and Quantitative Analysis, Georgia Southern University, Statesboro, Georgia 30460
Department of Quantitative Analysis and Operations Management, University of Cincinnati, Cincinnati, Ohio 45221
Department of Marketing, University of Cincinnati, Cincinnati, Ohio 45221

xfwang{at}georgiasouthern.edu
jeff.camm{at}uc.edu
david.curry{at}uc.edu

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.

Key Words: branch and price; column generation; combinatorial optimization; conjoint analysis; integer programming; marketing; optimization; product line design; share of choice
History: Received: November 3, 2008; accepted: May 24, 2009.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.