| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6898134 | European Journal of Operational Research | 2013 | 10 Pages |
Abstract
⺠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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Eduardo Fernandez, Rafael Olmedo,