scispace - formally typeset
Journal ArticleDOI

Heuristics for pricing and positioning a product-line using conjoint and cost data

Gregory Dobson, +1 more
- 01 Feb 1993 - 
- Vol. 39, Iss: 2, pp 160-175
Reads0
Chats0
TLDR
In this article, the authors formalize the problem as a mathematical program where the objective of the firm is either profit or total welfare, and they develop a new greedy heuristic for the profit problem, and its application to simulated problems shows that it too runs quickly, and with better performance than various alternatives and previously published heuristics.
Abstract
Designing and pricing a product-line is the very essence of every business. In recent years quantitative methods to assist managers in this task have been gaining in popularity. Conjoint analysis is already widely used to measure preferences for different product profiles, and build market simulation models. In the last few years several papers have been published that suggest how to optimally choose a product-line based on such data. We formalize this problem as a mathematical program where the objective of the firm is either profit or total welfare. Unlike alternative published approaches, we introduce fixed and variable costs for each product profile. The number of products to be introduced is endogenously determined on the basis of their desirability, fixed and variable costs, and in the case of profits, their cannibalization effect on other products. While the problem is difficult NP-complete, we show that the maximum welfare problem is equivalent to the uncapacitated plant location problem, which can be solved very efficiently using the greedy interchange heuristic. Based on past published experience with this problem, and on simulations we perform, we show that optimal or near optimal solutions are obtained in seconds for large problems. We develop a new greedy heuristic for the profit problem, and its application to simulated problems shows that it too runs quickly, and with better performance than various alternatives and previously published heuristics. We also show how the methodology can be applied, taking existing products of both the firm and the competition into account.

read more

Citations
More filters
Journal ArticleDOI

Product Development Decisions: A Review of the Literature

TL;DR: This paper looks inside the "black box" of product development at the fundamentaldecisions that are made by intention or default, adopting the perspective ofproduct development as a deliberate business process involving hundreds of decisions, many of which can be usefully supported by knowledge and tools.
Journal ArticleDOI

Product platform design and customization: Status and promise

TL;DR: This paper provides a comprehensive review of the flurry of research activity that has occurred during that time to facilitate product family design and platform-based product development for mass customization.
Book ChapterDOI

Information Sharing and Supply Chain Coordination

TL;DR: This chapter discusses the information pertaining to the downstream part of the supply chain and then reviews the upstream information and addresses the incentive issues in information sharing.
Book ChapterDOI

Assortment Planning: Review of Literature and Industry Practice

TL;DR: In this article, the goal of assortment planning is to specify an assortment that maximizes sales or gross margin subject to various constraints, such as a limited budget for purchase of products, limited shelf space for displaying products, and a variety of miscellaneous constraints such as desire to have at least two vendors for each type of product.
Journal ArticleDOI

Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint

TL;DR: This work develops an adaptive policy that learns the unknown parameters from past data and at the same time optimizes the profit and develops a simple algorithm for computing a profit-maximizing assortment based on the geometry of lines in the plane.
References
More filters
Book

Computers and Intractability: A Guide to the Theory of NP-Completeness

TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book

Economics and consumer behavior

TL;DR: Deaton and Muellbauer as mentioned in this paper introduced generations of students to the economic theory of consumer behaviour and used it in applied econometrics, including consumer index numbers, household characteristics, demand, and household welfare comparisons.
Journal ArticleDOI

Conjoint Analysis in Consumer Research: Issues and Outlook

TL;DR: In this paper, the authors discuss various issues involved in implementing conjoint analysis and describe some new technical developments and application areas for the methodology, which has been applied to a wide variety of problems in consumer research.
Related Papers (5)