The Generalized Reachable Sets (GRS) method is an original graphic approach, which helps to visualize the information hidden in mathematical models and databases. It can be used in a lot of fields including exploration of dynamic systems, aggregation of economic models, data envelopment analysis, but its application in the framework of selecting small number of alternatives from a large or even infinite variety turned to be especially practical. For example, GRS method can be used for decision screening, i.e. selecting preferable feasible variants in a decision situation. Another important application is selecting preferable rows from a large relational database (datawarehouse).
Three main forms of the GRS have been developed and implemented in the form of generic software:
1) the FEASIBLE GOALS method, which is used in decision and negotiation support systems for decision screening;
2) the REASONABLE GOALS method for selecting preferable rows from large relational databases (datawarehouses) through special form of data mining based on enveloping of points in attribute space, which are related to db rows;
3) the REASONABLE GOALS method (general case), which is used mainly for decision screening in computer aided design, and applies the ideas of enveloping of criterion points.
Here, you may want to download a self running demo that contains description of the GRS method and illustrates several applications. This demo looks old fashioned (all software systems described are in DOS), but it gives an idea of the method. To download the demo, use the button.
One can look at the lists of applications of the GRS-based methods and and of possible applications.