An approach to solving discrete vector optimization problems over a combinatorial set of permutations.
Електронний архів Полтавського університету економіки і торгівлі
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
An approach to solving discrete vector optimization problems over a combinatorial set of permutations.
|
|
| Creator |
Semenova N. V.
Nagornaya A. N. Koliechkina L. |
|
| Subject |
multi-objective optimization
combinatorial set set of permutations Pareto-optimal solution |
|
| Description |
Complex discrete multicriteria problems over a combinatorial set of permutations are analyzed. Some properties of an admissible domain for a combinatorial multicriteria problem embedded into an arithmetic Euclidian space are considered. Optimality conditions are obtained for different types of effective solutions. A new approach to solving the problems formulated is constructed and substantiated. |
|
| Publisher |
Natsional\cprime naya Akademiya Nauk Ukrainy. Institut Kibernetiki im. V. M. Glushkova. Kibernetika i Sistemny\uı\ Analiz
|
|
| Date |
2016-04-04T07:25:41Z
2016-04-04T07:25:41Z 2008 |
|
| Identifier |
N. V. Semenova, L. N. Kolechkina, and A. N. Nagornaya, “An approach to the solution of vector discrete optimization problems on a combinatorial set of permutations,” Kibernet. Sistem. Anal., vol. 44, no. 3, pp. 158–172, 190–191, 2008.
0023-1274 http://dspace.puet.edu.ua/handle/123456789/3421 |
|
| Language |
en
|
|