Reasonable Goals Method and Its Applications

Abstract

The Reasonable Goals method (RGM) is introduced in this chapter, and several applications of the method are described. We consider a simplest form of the RGM here, which supports selecting of a small number of alternatives from given lists that contain a large, but finite, number of decision alternatives. Such lists may contain millions of alternatives. The RGM is based on representing decision alternatives in the form of criterion points and on approximating the convex hull (envelope) of a variety of points. To be precise, the EPH of the convex hull is approximated. Due to such enveloping, the IDM technique can be applied, but now the user studies proxy tradeoffs between the criteria. Application of the IDM technique for exploration of the Pareto frontier of the envelope and identifying a goal vector (so-called reasonable goal) on it are the main features of the RGM. Since the convex hull is explored instead of the variety of points itself, an identified goal may not be feasible, but only reasonable. As a result, several decision alternatives that are in line with the identified goal are selected.