Models and Heuristics for Product Line Selection

Recently, a number of articles have appeared in the marketing literature dealing with single product design optimization. The present paper represents a start toward extending this research to product line decisions. We first formulate two versions of the problem and describe their various characteristics. Since finding the optimum solution is computationally prohibitive, even for modest size problems, various heuristic approaches are presented and evaluated. Applications involving synthetic and real data are discussed. The paper concludes with comments on related problems and future application areas.

[1]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[2]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[3]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[4]  Fred S. Zufryden,et al.  ZIPMAP — A Zero-One Integer Programming Model for Market Segmentation and Product Positioning , 1979 .

[5]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[6]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

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

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

[9]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[10]  Allan D. Shocker,et al.  Multiattribute Approaches for Product Concept Evaluation and Generation: A Critical Review , 1979 .

[11]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[12]  Paul E. Green,et al.  A General Approach to Product Design Optimization via Conjoint Analysis , 1981 .

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

[14]  D. G. Morrison.  Purchase Intentions and Purchase Behavior , 1979 .

[15]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems: an annotated bibliography , 1976 .

[16]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

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

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

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

[20]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[21]  Allan D. Shocker.  Limitations of Incremental Search in Media Selection , 1970 .

[22]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[23]  A. Bachem,et al.  A product positioning model with costs and prices , 1981 .

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

[25]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[26]  Sönke Albers,et al.  An extended algorithm for optimal product positioning , 1979 .