IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v36y1990i12p1464-1478.html
   My bibliography  Save this article

Heuristics for Product-Line Design Using Conjoint Analysis

Author

Listed:
  • Rajeev Kohli

    (Joseph M. Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, Pennsylvania 15260)

  • R. Sukumar

    (College of Business Administration, University of Houston, Houston, Texas 77204-6283)

Abstract

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.

Suggested Citation

  • Rajeev Kohli & R. Sukumar, 1990. "Heuristics for Product-Line Design Using Conjoint Analysis," Management Science, INFORMS, vol. 36(12), pages 1464-1478, December.
    • Handle: RePEc:inm:ormnsc:v:36:y:1990:i:12:p:1464-1478
    DOI: 10.1287/mnsc.36.12.1464
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.36.12.1464
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.36.12.1464?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:36:y:1990:i:12:p:1464-1478. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.