A practical weight sensitivity algorithm for goal and multiple objective programming
This paper presents a weight sensitivity algorithm that can be used to investigate a portion of weight space of interest to the decision maker in a goal or multiple objective programme. The preferential information required from the decision maker is an initial estimate of their starting solution, with an equal weights solution being used as a default if this is not available, and preference information that will define the portion of weight space on which the sensitivity analysis is to be conducted. The different types of preferential information and how they are incorporated by the algorithm are discussed. The output of the algorithm is a set of distinct solutions that characterise the portion of weight space searched. The possible different output requirements of decision makers are detailed in the context of the algorithm. The methodology is demonstrated on two examples, one hypothetical and the other relating to predicting cinema-going behaviour. Conclusions and avenues for future research are given.
multi-objective programming goal programming preferential weight choice multiple criteria decision making