An outranking-based general approach to solving group multi-objective optimization problems

► A general approach to solving group multi-objective programming problems. ► Based on optimizing a bi-objective measure of “collective satisfaction”. ► Satisfaction is understood as a balance between an agreeing and an opposing coalition. ► Each decision maker solves his/her own optimization problem. ► The search for the best agreement is not limited to portions of the Pareto frontier.