  In this paper, we demonstrate how the problem of the optimal team choice in
the popular computer game Dota Underlords can be reduced to the problem of
linear integer programming. We propose a model and solve it for the real data.
We also prove that this problem belongs to the NP-complete class and show that
it reduces to the maximum edge weighted clique problem.
