haku: @author Kohli, R. / yhteensä: 11
viite: 8 / 11
| Tekijä: | Kohli, R. Krishnamurti, R. |
| Otsikko: | Optimal product design using conjoint analysis: Computational complexity and algorithms. |
| Lehti: | European Journal of Operational Research
1989 : MAY 25, VOL. 40:2, p. 186-195 |
| Asiasana: | HEURISTIC METHODS PRODUCT DESIGN CONJOINT ANALYSIS OPTIMIZATION |
| Kieli: | eng |
| Tiivistelmä: | The problem of maximizing the share of a new product introduced in a competitive market is shown. A directed graph representation of the problem is used to construct shortest-path and dynamic-programming heuristics. Both heuristics are shown to have arbitrary-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. The formulation presented assumes deterministic consumer choices. Alternative formulations in which preferences are related in a probabilistic manner to utilities of choice set items may be investigated. |
SCIMA