Optimal product design using conjoint analysis: Computational complexity and algorithms

DOI10.1016/0377-2217(89)90329-9zbMath0663.90053OpenAlexW2007317506MaRDI QIDQ1115344

Rajeev Kohli, Ramesh Krishnamurti

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90329-9

zbMATH Keywords

marketingNP-hardworst-caseconjoint analysisdynamic programming heuristicsoptimal product designshortest path heuristic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Operations research and management science (90B99)

Related Items

An evolutionary algorithm approach to the share of choices problem in the product line design ⋮ Advanced conjoint analysis using feature selection via support vector machines ⋮ Optimal product line design: genetic algorithm approach to mitigate cannibalization ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ A model of product line design and introduction sequence with reservation utility ⋮ On envy-free perfect matching ⋮ A model and solution method for multi-period sales promotion design. ⋮ Optimal product design using a colony of virtual ants ⋮ Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs ⋮ Exact First-Choice Product Line Optimization ⋮ New formulations and valid inequalities for a bilevel pricing problem ⋮ Valid inequalities and branch-and-cut for the clique pricing problem ⋮ A pricing problem under Monge property ⋮ Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover ⋮ An efficient solution method to design the cost-minimizing platform portfolio ⋮ On the product line selection problem under attraction choice models of consumer behavior ⋮ A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study ⋮ Fuzzy self-tuning differential evolution for optimal product line design ⋮ A polyhedral study of the network pricing problem with connected toll arcs ⋮ Clonal selection algorithms for optimal product line design: a comparative study ⋮ A pruning heuristic for use with multisource product design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• Estimating the weights for multiple attributes in a composite criterion using pairwise judgments
• Worst-Case Analysis of Heuristic Algorithms
• On the Computational Complexity of Combinatorial Problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Orthogonal Main-Effect Plans for Asymmetrical Factorial Experiments
• THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS