Convexity of sets in linear spaces, and concavity and convexity of functions, lie at the root of beautiful theoretical results that are at the same time extremely useful in the analysis and solution of optimization problems, including problems of either single objective or multiple objectives....

The body of literature on goal programming (GP) approaches in modeling preferences and the satisfaction philosophy in multi-objective programming (MOP) decision-making processes is extensive. However, there has been little focus on how preferences change in relation to the decision-maker's (DM)...