Since all zj − cj ≥ 0, the current solution is optimum and the optimum integer solution is
x1 = 4, x2 = 3 with maximum of z = 55
Gomory’s Mixed Integer Method
In mixed integer programming problem only some of the variables are integer constrained, while the other variables may take integer or other real values. Like the pure integer problem, the mixed integer problem should be of the maximisation type and all the coefficients and constants should be integers.
The problem is first solved as a continuous LPP by ignoring the integerality condition. If the values of the integer constrained variables are integers, then the current ...