Method of Global Criterion and Compromise Programming

Method of Global Criterion (Hwang and Masud 1979) and Compromise Programming (Zeleny 1982) fall under the class of MCMP methods that do not require any preference information from the DM. Consider the MCMP problem given by Equation 2.14. Let 

The values of// are obtained by maximizing each objective/ subject to the constraints xe S but ignoring the other objectives. The value of p can be 1, 2,3. and so on. Note that p = 1 implies equal importance to all deviations from the ideal. As p increases, larger deviations have more weight. 

---