Conjoint optimization: An exact branch-and-bound algorithm for the share-of-choice problem

Management Science

Volumn 52, Issue 3, 2006, Pages 435-447

  Camm, Jeffrey D ^a   Cochran, James J ^b   Curry, David J ^a   Kannan, Sriram ^c  

^a UNIVERSITY OF CINCINNATI   (United States)

^b LOUISIANA TECH UNIVERSITY   (United States)

^c Research Group   (United States)

Author keywords

Combinatorial optimization; Conjoint analysis; Integer programming; Marketing; Optimization; Product design

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONJOINT ANALYSIS; SHARE-OF-CHOICE PROBLEM;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; INTEGER PROGRAMMING; MARKETING; PROBLEM SOLVING; PRODUCT DESIGN; STATISTICAL METHODS;

OPTIMIZATION;

EID: 33644906688     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1050.0461     Document Type: Article

References (44)

1. Allenby, G. M., P. Rossi. 1999. Marketing models of consumer heterogeneity. J. Econometrics 89 57-78.
2. Allenby, G. M., N. Arora, J. L. Ginter. 1995. Incorporating prior knowledge into the analysis of conjoint studies. J. Marketing Res. 32(May) 152-162.
3. Allenby, G. M., N. Arora, J. L. Ginter. 1998. On the heterogeneity of demand. J. Marketing Res. 35 384-389.
4. Allenby, G. M., N. Arora, C. Diener, J. Kim, M. Lotti, P. Markowitz. 2002. Distinguishing likelihoods, loss functions and heterogeneity in the evaluation of marketing models. Canadian J. Marketing Res. 20(1) 44-15.
5. Balakrishnan, P. V., V. S. Jacob. 1996. Genetic algorithms for product design. Management Sci. 42(8) 1105-1117.
6. Bradlow, E. T. 2003. Current issues and a "wish list" for conjoint analysis. Working paper, The Wharton School, University of Pennsylvania, Philadelphia, PA, 1-10.
7. Church, R. L., C. ReVelle. 1974. The maximal covering location problem. Papers Regional Sci. Assoc. 23 101-118.
8. Cochran, J. J. 1997. Statistical characteristics of coverage optimization based on sample data. Doctoral dissertation, University of Cincinnati, Cincinnati, OH.
9. Curry, D. J. 2004. Hurdle models for conjoint optimization: Exposition and extensions. Working paper, University of Cincinnati, Cincinnati, OH.
10. Dahan, E., V. Srinivasan. 2000. The predictive power of Internet-based product concept testing using visual depiction and animation. J. Product Innovation Management 17(March) 99-109.
11. Dahan, E., J. R. Hauser, D. Simester, O. Toubia. 2002. Application and test of Web-based adaptive polyhedral conjoint analysis. Paper 146, Sloan School of Management, MIT, Cambridge, MA.
12. Downs, B. T., J. D. Camm. 1996. An exact algorithm for the maximal covering problem. Naval Res. Logist. 43 435-461.
13. Fourer, R., D. M. Gay, B. W. Kernighan. 2002. AMPL, A Modeling Language for Mathematical Programming, 2nd ed. Boyd and Fraser Publishing Company, Danvers, MA.
14. Gilbride, T. J., G. M. Allenby. 2004. A choice model with conjunctive, disjunctive, and compensatory screening rules. Marketing Sci. 23(3) 391-106.
15. Green, P. E., A. M. Krieger. 1988. Choice rules and sensitivity analysis in conjoint simulators. J. Acad. Marketing Sci. 16(1) 114-127.
16. Green, P. E., A. M. Krieger. 1989. Recent contributions to optimal product positioning and buyer segmentation. Eur. J. Oper. Res. 41 127-141.
17. Green, P. E., A. M. Krieger. 1993. Conjoint analysis with productpositioning applications. Handbooks in Operations Research & Management Science, Volume 5. North-Holland, New York, 467-515.
18. Green, P. E., J. D. Carroll, S. M. Goldberg. 1981. A general approach to product design optimization via conjoint analysis. J. Marketing 45 17-37.
19. Green, P. E., A. M. Krieger, Y. Wind. 2001. Thirty years of conjoint analysis: Reflections and prospects. Interfaces 31(3) S56-S73.
20. Green, P. E., A. M. Krieger, J. Wind. 2003. Buyer choice simulators, optimizers, and dynamic models. J. Wind, P. E. Green, eds. Market Research and Modeling: Progress and Prospects, A Tribute to Paul E. Green. Kluwer Academic Publishers, Norwell, MA.
21. Hauser, J. R., G. J. Tellis, A. Griffin. 2004. Research on innovation: A review and agenda for marketing science. Working paper, Sloan School of Management, MIT, Cambridge, MA.
22. Huber, J., B. K. Orme, R. Miller. 2001. Dealing with product similarity in conjoint simulation. A. Gustafsson, A. Herrmann, F. Huber, eds. Conjoint Measurement, 2nd ed. Springer-Verlag, Berlin-Heidelberg, Germany, 479-496.
23. ILOG, Inc. 2003. ILOG CPLEX 8.0 User's Manual. Mountain View, CA.
24. Johnson, R. 1987. Accuracy of utility estimation in ACA. Working paper, Sawtooth Software, Sequim, WA.
25. Kohli, R., R. Krishnamurti. 1987. A heuristic approach to product design. Management Sci. 33 1523-1533.
26. Kohli, R., R. Krishnamurti. 1989. Optimal product design using conjoint analysis: Computational complexity and algorithms. Eur. J. Oper. Res. 40 186-195.
27. Kohli, R., R. Sukumar. 1990. Heuristics for product line design using conjoint analysis. Management Sci. 36(12) 1464-1478.
28. Krieger, A. M., P. E. Green, J. Wind. 2004. Adventures in conjoint analysis: A practitioner's guide to trade-off modeling and applications. Working paper, The Wharton School, University of Pennsylvania, Philadelphia, PA.
29. Kuhfeld, W., R. D. Tobias, M. Garratt. 1994. Efficient experimental design with marketing research applications. J. Marketing Res. 31(November) 545-557.
30. Lenk, P., W. DeSarbo, P. E. Green, M. Young. 1996. Hierarchical Bayes conjoint analysis: Recovery of partworth heterogeneity from reduced experimental designs. Marketing Sci. 15(2) 173-191.
31. McBride, R. D., F. S. Zufryden. 1988. An integer programming approach to the optimal product line selection problem. Marketing Sci. 7(2) 126-140.
32. Orme, B. K., J. Huber. 2000. Improving the value of conjoint simulations. Marketing Res. 12(4) 12-20.
33. Rossi, P. E., G. M. Allenby. 2003. Bayesian statistics and marketing. Marketing Sci. 22(3) 304-328.
34. Sawtooth Software. 2003. Advanced simulation module for product optimization VI. Technical paper, Sawtooth Software, Inc., Sequim, WA, 1-26.
35. Shi, L., S. Olafsson. 2000. Nested partitions method for global optimization. Oper. Res. 48 390-407.
36. Shi, L., S. Olafsson, Q. Chen. 2001. An optimization framework for product design. Management Sci. 47(12) 1681-1692.
37. Toubia, O., D. I. Simester, J. R. Hauser, E. Dahan. 2003. Fast polyhedral adaptive conjoint estimation. Marketing Sci. 22(Summer) 273-303.
38. Toubia, O., J. R. Hauser, D. I. Simester. 2004. Polyhedral methods for adaptive choice-based conjoint analysis. J. Marketing Res. 41(February) 116-131.
39. Train, K. E. 2003. Discrete Choice Methods with Simulation. Cambridge University Press, Cambridge, UK.
40. Vavra, T. G., P. E. Green, A. M. Krieger. 1999. Evaluating EZ-Pass: Using conjoint analysis to assess consumer response to a new tollway technology. Marketing Res. 11(2) 5-13.
41. Wind, J., P. E. Green, D. Shifflet, M. Scarbrough. 1989. Courtyard by Marriott: Designing a hotel facility with consumer-based marketing models. Interfaces 19 25-47.
42. Wittink, D. R., P. Cattin. 1989. Commercial use of conjoint analysis: An update. J. Marketing 53 91-96.
43. Wittink, D. R., M. Vriens, W. Burhenne. 1994. Commercial use of conjoint analysis in Europe: Results and critical reflections. Internat. J. Res. Marketing 11 41-52.
44. Zufryden, F. S. 1977. A conjoint measurement-based approach for optimal new product design and market segmentation. A. D. Shocker, ed. Analytical Approaches to Product and Market Planning. Marketing Science Institute, Cambridge, MA, 100-114.