Oleg A.
Emets Natalya Yu.
Ustian ABSTRACT We construct and investigate mathematical models of optimization problems on arrangements of game type, for which one player has combinatorial restrictions for use of his strategies. For problems of 2 × n and m × 2 dimension modified graphical method is suggested. Theorems of equivalence of each model to two optimization problems are proved and methods of their solution are suggested.
<< Previous article Next article >> |
||||||||||||||||||||||