A graphical extension of compromise programming
Аннотация
Compromise programming is based on the concept of the ideal point and relies on distance functions for evaluation purposes. Analysts usually rely on graphical methods to construct the non-dominated frontier to select the best alternatives when dealing with two criteria. However, this graphical analysis becomes more complex when dealing with three or more criteria. To solve this limitation, this work proposes a graphical extension of compromise programming in which the ideal point is replaced with an ideal polygon, and the distance functions to the ideal point are replaced with area functions within multiaxis graphs. We evaluate alternatives by relying on two novel area functions of the polygons formed by the degree of achievement of each criterion on a graph. In addition to reporting novel theoretical results, we illustrate our method with graphical and quantitative analyses of the degree of development of cooperative banking in Europe using five indicators.