590 Integer Programming
Figure 10.1 Graphical solution of the problem stated in Eqs. (10.1).by changing the constraint 3x 1 + 11 x 2 ≤ 6 to 7 6 x 1 + 11 x 2 ≤ 8 in Eqs. (10.1). With 8
this altered constraint, the feasible region and the solution of the LP problem, without
considering the integer requirement, are shown in Fig. 10.2. The optimum solution
of this problem is identical with that of the preceding problem: namely,x 1 = 512 ,Figure 10.2 Graphical solution with modified constraint.