Optimizing product line designs: Efficient methods and comparisons

Management Science

Volumn 54, Issue 9, 2008, Pages 1544-1552

  Belloni, Alexandre ^a   Freund, Robert ^b   Selove, Matthew ^b   Simester, Duncan ^b  

^a DUKE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Conjoint; Optimization; Product line design

Indexed keywords

CONJOINT; DATA SOURCES; DIVIDE-AND-CONQUER; EFFICIENT METHODS; GLOBAL OPTIMALITY; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; OPTIMIZATION METHODS; PRODUCT LINE DESIGN; TWO SOURCES;

COMPUTER HARDWARE; DESIGN; HEURISTIC ALGORITHMS; OPTIMAL SYSTEMS; SIMULATED ANNEALING;

HEURISTIC METHODS;

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

References (28)

1. Aarts, E., J. Korst, P. van Laarhoven. 1997. Simulated annealing. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 91-120.
2. Alexouda, G., K. Paparrizos. 2001. A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study. Eur. J. Oper. Res. 134(1) 165-178.
3. Balakrishnan, P. V., V. S. Jacob. 1996. Genetic algorithms for product design. Management Sci. 42(8) 1105-1117.
4. Balakrishnan, P. V., R. Gupta, V. Jacob. 2004. Development of hybrid genetic algorithms for product line designs. IEEE Trans. Systems, Man, Cybernetics 34(1) 468-483.
5. Belloni, A., A. Lucena. 2004. Lagrangian heuristics for the linear ordering problem. M. G. C. Resende, J. P. de Sousa, eds. Metaheuristics: Computer Decision-Making. Kluwer Academic Publishers, Norwell, MA, 37-64.
6. Belloni, A., C. Sagastizábal. 2008. Dynamic bundle methods. Math. Programming. Forthcoming.
7. Bertsekas, D. P. 1999. Nonlinear Programming. Athena Scientific, Belmont, MA.
8. Bertsimas, D., J. Tsitsiklis. 1997. Introduction to Linear Optimization. Athena Scientific, Belmont, MA.
9. Camm, J. D., J. J. Cochran, D. J. Curry, S. Kannan. 2006. Conjoint optimization: An exact branch-and-bound algorithm for the share-of-choice problem. Management Sci. 52(3) 435-447.
10. Dobson, G., S. Kalish. 1988. Positioning and pricing a product line. Marketing Sci. 7(2) 107-125.
11. Dobson, G., S. Kalish. 1993. Heuristics for pricing and positioning a product line using conjoint and cost data. Management Sci. 39(2) 160-175.
12. Green, P. E., A. M. Krieger. 1985. Models and heuristics for product line selection. Marketing Sci. 4(1) 1-19.
13. Green, P. E., A. M. Krieger. 1993. Conjoint analysis with productpositioning applications. J. Eliashberg, G. L. Lilien, eds. Handbooks in Operations Research & Management Science, Vol. 5. Elsevier Science B.V., Amsterdam, 467-515.
14. Green, P. E., A. M. Krieger, R. N. Zelnio. 1989. A componential segmentation model with optimal design features. Decision Sci. 20(2)221-238.
15. Gutin, G., A. Punnen. 2002. The Traveling Salesman Problem and Its Variation. Kluwer Academic Publishes, Dordrecht, The Netherlands.
16. Kellerer, H., U. Pferschy, D. Pisinger. 2004. Knapsack Problems. Springer, Berlin.
17. Kivetz, R., O. Netzer, V. Srinivasan. 2004. Alternative models for capturing the compromise effect. J. Marketing Res. 41(3) 237-257.
18. Kohli, R., R. Krishnamurti. 1987. A heuristic approach to product design. Management Sci. 33(12) 1523-1533.
19. Kohli, R., R. Krishnamurti. 1989. Optimal product design using conjoint analysis: Computational complexity and algorithms. Eur. J. Oper. Res. 40 186-195.
20. Kohli, R., R. Sukumar. 1990. Heuristics for product-line design using conjoint analysis. Management Sci. 36(12) 1464-1478.
21. Lucena, A. 1992. Steiner problem in graphs: Lagrangian relaxation and cutting-planes. COAL Bull. 21 2-8.
22. Lucena, A. 1993. Tight bounds for the Steiner problem in graphs. Proc. NETFLOW93, 147-154.
23. McBride, R. D., F. S. Zufryden. 1988. An integer programming approach to the optimal product line selection problem. Marketing Sci. 7(2) 126-140.
24. Nair, S. K., L. S. Thakur, K. Wen. 1995. Near optimal solutions for product line design and selection: Beam search heuristics. Management Sci. 41(5) 767-785.
25. Shi, L., S. Olafsson. 2000. Nested partitions method for global optimization. Oper. Res. 48(3) 390-407.
26. Shi, L., S. Olafsson, Q. Chen. 2001. An optimization framework for product design. Management Sci. 47(12) 1681-1692.
27. Steiner, W., H. Hruschka. 2003. Genetic algorithms for product design: How well do they really work? Internat. J. Market Res. 45(2) 229-240.
28. Toubia, O., D. I. Simester, J. R. Hauser, E. Dahan. 2003. Fast polyhedral adaptive conjoint estimation. Marketing Sci. 22(3) 273-303.