Heuristics for Product-Line Design Using Conjoint Analysis

Recently proposed methods for product-line selection use the total utilities of candidate items to construct product lines maximizing seller's return or buyers' welfare. For conjoint hybrid conjoint data, enumerating the utilities of candidate items can be computationally infeasible if the number of attributes and attribute levels is large and most multi-attribute alternatives are feasible. For such problems, constructing product lines directly from part-worths data is preferable. We propose such methods, extending Kohli and Krishnamurti's 1987 dynamic-programming heuristic for selecting a single item maximizing share to structure product lines maximizing share, seller's return, or buyers' utilitarian welfare. The computational performance of the heuristics and their approximation of product-line solutions is evaluated using simulated data. Across problem instances, the dynamic-programming heuristics identify solutions that are no worse, in terms of approximating optimal solutions, to the solutions of heuristics for the current two-step approaches to product-line design. An application using hybrid-conjoint data for a consumer-durable product is described.

[1]  Allan D. Shocker,et al.  A Consumer-Based Methodology for the Identification of New Product Ideas , 1974 .

[2]  Sönke Albers,et al.  A procedure for new product positioning in an attribute space , 1977 .

[3]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[4]  P. Green,et al.  Conjoint Analysis in Consumer Research: Issues and Outlook , 1978 .

[5]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[6]  B. Efron.  Computers and the Theory of Statistics: Thinking the Unthinkable , 1979 .

[7]  M. Fisher.  Worst-Case Analysis of Heuristic Algorithms , 1980 .

[8]  J. Hauser,et al.  Profit Maximizing Perceptual Positions: An Integrated Theory for the Selection of Product Features and Price , 1981 .

[9]  Jerrold H. May,et al.  A Simulation Comparison of Methods for New Product Location , 1983 .

[10]  Dan Horsky,et al.  An Approach to the Optimal Positioning of a New Product , 1983 .

[11]  Paul E. Green,et al.  Hybrid Models for Conjoint Analysis: An Expository Review , 1984 .

[12]  K. Moorthy.  Market Segmentation, Self-Selection, and Product Line Design , 1984 .

[13]  Paul E. Green,et al.  Models and Heuristics for Product Line Selection , 1985 .

[14]  Jaya P. Moily,et al.  Optimal and heuristic procedures for component log-splitting in multi-stage manufacturing systems , 1986 .

[15]  Ramesh Krishnamurti,et al.  A Heuristic Approach to Product Design , 1987 .

[16]  Jerrold H. May,et al.  Diffstrat: An analytical procedure for generating optimal new product concepts for a differentiated-type strategy , 1988 .

[17]  Fred S. Zufryden,et al.  An Integer Programming Approach to the Optimal Product Line Selection Problem , 1988 .

[18]  Jae Sik Lee,et al.  An approximate algorithm for multidimensional zero-one knapsack problems , 1988 .

[19]  Gregory Dobson,et al.  Positioning and Pricing a Product Line , 1988 .

[20]  Rajeev Kohli,et al.  Average Performance of Heuristics for Satisfiability , 1989, SIAM J. Discret. Math..

[21]  Rajeev Kohli,et al.  Designing Products and Services for Consumer Welfare: Theoretical and Empirical Issues , 1990 .