ДОСЛІДЖЕННЯ ЗАДАЧ КОМБІНАТОРНОЇ ОПТИМІЗАЦІЇ ІГРОВОГО ТИПУ НА РОЗМІЩЕННЯХ
Mathematical models of optimization problems of game type on arrangements, in which one player has combinatorial restrictions for using his strategies, are built and investigated. The modified graphic method for solving such problems of dimension 2 ´ n and m ´ 2 is offered. The theorems about the eq...
Gespeichert in:
| Datum: | 2007 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | Ukrainian |
| Veröffentlicht: |
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
2007
|
| Online Zugang: | https://jais.net.ua/index.php/files/article/view/287 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Problems of Control and Informatics |
Institution
Problems of Control and Informatics| Zusammenfassung: | Mathematical models of optimization problems of game type on arrangements, in which one player has combinatorial restrictions for using his strategies, are built and investigated. The modified graphic method for solving such problems of dimension 2 ´ n and m ´ 2 is offered. The theorems about the equivalence between each model and two optimization problems are proved; the methods for their solution are offered. |
|---|