In real life there are game problems in which players face with certain restrictions in the choice of strategy.
These decision problems lead to constrained games. The quadratic programming problem equivalent to a constrained bimatrix
game is shown which provides a general method solving constrained bi-matrix games and shows a perfect correspondence
between games and programming problems. Besides, a two-step method for constrained games is proposed
whose theme is transforming the constrained game into an equivalent ordinary game. In the end, an example is shown to
illustrate consistency of the two methods.