Optimal product design using conjoint analysis: Computational complexity and algorithms
From MaRDI portal
The problem of maximizing the share of a new product introduced in a competitive market is shown to be NP-hard. A directed graph representation of the problem is used to construct shortest path and dynamic programming heuristics. Both heuristics are shown to have arbitrarily bad worst-case bounds. Computational experience with real- sized problems is reported. Both heuristics identify near-optimal solutions for the simulated problems, the dynamic programming heuristic performing better than the shortest path heuristic.
Recommendations
- Conjoint optimization: an exact branch-and-bound algorithm for the share-of-choice problem
- A branch-and-price approach to the share-of-choice product line design problem
- Optimizing product line designs: efficient methods and comparisons
- Genetic Algorithms for Product Design
- scientific article; zbMATH DE number 770411
Cites work
- Estimating the weights for multiple attributes in a composite criterion using pairwise judgments
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Computational Complexity of Combinatorial Problems
- Orthogonal Main-Effect Plans for Asymmetrical Factorial Experiments
- Some simplified NP-complete graph problems
- THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
- Worst-Case Analysis of Heuristic Algorithms
Cited in
(34)- A model and solution method for multi-period sales promotion design.
- A pruning heuristic for use with multisource product design
- An efficient solution method to design the cost-minimizing platform portfolio
- An evolutionary algorithm approach to the share of choices problem in the product line design
- A model of product line design and introduction sequence with reservation utility
- Conjoint-based product (line) design considering competitive reactions
- Fuzzy self-tuning differential evolution for optimal product line design
- Clonal selection algorithms for optimal product line design: a comparative study
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- On envy-free perfect matching
- Optimal product design using a colony of virtual ants
- Advanced conjoint analysis using feature selection via support vector machines
- A polyhedral study of the network pricing problem with connected toll arcs
- An optimization framework for product design
- Conjoint optimization: an exact branch-and-bound algorithm for the share-of-choice problem
- Optimizing product line designs: efficient methods and comparisons
- A branch-and-price approach to the share-of-choice product line design problem
- A web-based methodology for product design evaluation and optimisation
- Efficient heuristic algorithms for maximum utility product pricing problems
- Genetic Algorithms for Product Design
- Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs
- Bicriteria product design optimization: An efficient solution procedure using AND/OR trees
- Complexity of Product Positioning and Ball Intersection Problems
- Exact first-choice product line optimization
- Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover
- Algorithms for marketing-mix optimization
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study
- One-stage product-line design heuristics: an empirical comparison
- Valid inequalities and branch-and-cut for the clique pricing problem
- Assortment planning in omnichannel retailing under product returns and showcase capacity
- Optimal product line design: genetic algorithm approach to mitigate cannibalization
- New formulations and valid inequalities for a bilevel pricing problem
- A pricing problem under Monge property
- On the product line selection problem under attraction choice models of consumer behavior
This page was built for publication: Optimal product design using conjoint analysis: Computational complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115344)
