MCDM'07 - paper no. 14


Back to MCDM'07 contents

Metrics in the compromise hypersphere method

Sebastian Sitarz


Compromise programming is one of most often applied methods of multicriteria optimization, both discrete and continuous. This paper deals with decision making in multicriteria linear programming problems. The approach presented here is based on finding a hypersphere (in the criteria space), which minimizes the distance from the set of all nondominated extreme points. Next, we look for the nondominated extreme point closest to the hypersphere found previously. This point, called the best compromise nondominated solution, depends on the chosen metric. We consider the method of compromise hypersphere with different metrics and analyze their influence on the best compromise nondominated solution.


multicriteria linear programming, compromise programming

Reference index:

Sebastian Sitarz, (2008), Metrics in the compromise hypersphere method, Multiple Criteria Decision Making (3), pp. 223-232

Full text: