In this paper, a goal programming method has been proposed to derive the weights from PCMs. This new method has been contrasted with the least squares and logarithmic least squares methods on various properties of ratio-scale matrices. A number of advantages of goal programming method over the least squares and logarithmic least squares methods are also pointed out. Finally, the proposed method has been illustrated by means of numerical examples. Today we feel more and more that such methods sometimes are not well suited to the studied problem, because there is not only one decision maker but several.
Emphasis is put on visual tools.
The firm objectives are to maximize the expected value of the real goodwill level at the launch time and to minimize the total advertising expenditure. The relevant constraint is that of obtaining asuccessful launch with a probability greater than or equal to a fixed threshold. We observe that, if a special condition on the probability distributions of the final goodwill holds, then the problem is equivalent to a deterministic optimal control problem which has a known optimal solution. Ricerca Operativa vol. This assumption is not realistic in models where clients of services are independent decision-makers and take decisions that are probabilistic in nature.