An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot be solved by the simplex method. They are solved by specialized procedures which are computer intensive.