| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 481095 | European Journal of Operational Research | 2010 | 9 Pages |
Abstract
We consider the problem of selecting a predetermined number of objects from a given finite set. It is assumed that the preferences of the decision maker on this set are only partially known. Our solution approach is based on the notions of optimal and non-dominated subsets. The properties of such subsets and the objects they contain are investigated. The implementation of the developed approach is discussed and illustrated by various examples.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Vladislav V. Podinovski,