Abstract. The paper considers a combinatorial optimization problem of game type where constraints determined by arrangements are imposed on the strategies of one player and proposes a theoretical grounding for the iteration method of the solution to combinatorial optimization problems.

Keywords: Euclidean combinatorial optimization, game-type combinatorial optimization problem, iterative method, convergence of a method.