ABSTRACT
GP is an analytical approach devised to address decision making problems in which targets have been assigned to all the attributes and the decision maker is interested in minimizing the non-achievements of the corresponding goals (Romero, 2001). Generally, goal programming deals with the following MOP problems:
= …
≤ ≥
f x i n s t g x
x
max ( ), 1, , . . ( ) 0,
where xf ( )i denotes the ith objective function.
