An Integer Programming Approach to the Optimal Product Line Selection Problem

Richard D. McBride and Fred S. Zufryden
Additional contact information
Richard D. McBride: University of Southern California
Fred S. Zufryden: University of Southern California

Marketing Science, 1988, vol. 7, issue 2, 126-140

Abstract: A zero-one integer mathematical programming formulation is proposed to solve the optimal product line selection problem. Based on individual consumer measurements from conjoint analysis, the formulation seeks to find an optimal subset of products that is drawn from a proposed set of product alternatives with specified product characteristics. In addition to its inherent flexibility in incorporating various realistic constraints, a feature of the proposed approach is its potential determination of verifiable optimal solutions to the product line selection problem. The results of computational experience with an optimization code, known as the X-system, are presented. Using a variety of representative simulated cases, it is shown that the X-system can be used to effectively solve product line selection problems on both mainframe and AT personal computers.

Keywords: product line selection; product design; integer mathematical programming (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (48)

Downloads: (external link)
http://dx.doi.org/10.1287/mksc.7.2.126 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormksc:v:7:y:1988:i:2:p:126-140

Access Statistics for this article

More articles in Marketing Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().