An approach to competitive product line design using conjoint data

被引:25
作者
Kuzmanovic, Marija [1 ]
Martic, Milan [1 ]
机构
[1] Univ Belgrade, Fac Org Sci, Dept Operat Res & Stat, Belgrade 11000, Serbia
关键词
Product line design; Conjoint analysis; Nash equilibrium; Competition; Product differentiation; GENETIC ALGORITHMS; PRICE-COMPETITION; HEURISTICS; MODEL; OPTIMIZATION; SELECTION; SHARE;
D O I
10.1016/j.eswa.2012.01.097
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In today's highly competitive environment, where market oriented firms aim to maximize profits through customer satisfaction, there is an increasing need to design a product line, rather than a single product. The main goal of designing a profit maximizing product line is to target the 'right product' to the 'right customer'. Although conjoint analysis has turned out to be one of the most widely used techniques for product line design, it falls to explicitly consider retaliatory reactions from competitors. In this paper, we propose a new conjoint-based approach to competitive new product line design, employing the Nash equilibrium concept. The optimal product line design problem for each firm is formulated as a nonlinear integer programming problem. In the absence of a closed-form solution, to compute the Nash equilibrium and to determine the optimal product line, we propose a two-phase procedure: a sequential iterative procedure in the first phase, and backward induction in the second. To solve the optimization problem in each of the iterations of the sequential procedure, we used the branch-and-bound method. The proposed approach is illustrated under several scenarios of competition using previously published conjoint data. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:7262 / 7269
页数:8
相关论文
共 34 条
[1]   Optimal product design using a colony of virtual ants [J].
Albritton, M. David ;
McMullen, Patrick R. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) :498-520
[2]   An evolutionary algorithm approach to the share of choices problem in the product line design [J].
Alexouda, G .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (13) :2215-2229
[3]   A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study [J].
Alexouda, G ;
Paparrizos, K .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 134 (01) :165-178
[4]   Genetic algorithms for product design [J].
Balakrishnan, PV ;
Jacob, VS .
MANAGEMENT SCIENCE, 1996, 42 (08) :1105-1117
[5]   Conjoint optimization: An exact branch-and-bound algorithm for the share-of-choice problem [J].
Camm, JD ;
Cochran, JJ ;
Curry, DJ ;
Kaman, S .
MANAGEMENT SCIENCE, 2006, 52 (03) :435-447
[6]   Technical note: Mathematical properties of the optimal product line selection problem using choice-based conjoint analysis [J].
Chen, KD ;
Hausman, WH .
MANAGEMENT SCIENCE, 2000, 46 (02) :327-332
[7]  
Choi CS, 1993, MARKET LETT, V4, P337, DOI DOI 10.1007/BF00994352
[8]   PRODUCT POSITIONING UNDER PRICE-COMPETITION [J].
CHOI, SC ;
DESARBO, WS ;
HARKER, PT .
MANAGEMENT SCIENCE, 1990, 36 (02) :175-199
[9]   A NUMERICAL APPROACH TO DERIVING LONG-RUN EQUILIBRIUM SOLUTIONS IN SPATIAL POSITIONING MODELS [J].
CHOI, SC ;
DESARBO, WS ;
HARKER, PT .
MANAGEMENT SCIENCE, 1992, 38 (01) :75-86
[10]  
CHOI SC, 1994, J PROD INNOVAT MANAG, V11, P451