Nowadays, interval comparison matrices (ICM) take an important role in decision making under uncertainty. So it seems that a brief review on solution methods used in ICM should be useful. In this paper, the common methods are divided into four categories that are Goal Programming Method (GPM), Linear Programming Method (LPM), Non-Linear Programming Method (NLPM) and Statistic Analysis (SA). GPM...

In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations with respect to targets. In particular, classical Linear Goal Programming problems, as well as several models in Location and Regression Analysis are modeled within this framework. In spite of its generality, this probl...

Goal programming is a technique often used in engineering design activities primarily to find a compromised solution which will simultaneously satisfy a number of design goals. In solving goal programming problems, classical methods reduce the multiple goal-attainment problem into a single objective of minimizing a weighted sum of deviations from goals. Moreover, in tackling non-linear goal pro...

Goal programming is a technique often used in engineering design activities primarily to find a compromised solution which will simultaneously satisfy a number of design goals. In solving goal programming problems, classical methods reduce the multiple goal-attainment problem into a single objective of minimizing a weighted sum of deviations from goals. In this paper, we pose the goal programmi...