On bilevel programming problems with equilibrium at the lower level
The new formulation of bilevel programming problems with generalized bimatrix games at the lower level is proposed. The reduction of the problem in optimistic statement to the nonconvex mathematical programming problem is realized.