Professional Documents
Culture Documents
All IPP
All IPP
to
linear
integer
Objective function
Max Z = 2X1 + 2X2
Constraints
5X1 + 3X2 8
X1 + 2X2 4
X1, X2 0 and both are INTEGERS.
After the
S1, S2 0
addition
of
SLACKS,
Objective function
Max Z = 2X1 + 2X2 + 0S1 + 0S2
S.t.
5X1 + 3X2 + S1
=8
X1 + 2X2 +
S2 = 4
X1, X2 0 and both are integers.
Here all Cj-Zj 0 but as we can see this Basic Feasible Solution (X1=4/7 and X2=12/7) does
not comply with the Integer Constraint.
So, now we will use the GOMORYs CUT.
fraction. If the fraction is negative then break into a negative integer and a positive fraction.
+ =
Here all Cj-Zj 0 and moreover the solution is also feasible but we need to have integers in
the solution.
So, we will repeat the whole process again and introduce a new Gomorian Constraint.
+ =
We need to take case of feasibility, so we will go for the Dual Simplex Method.
Here all Cj-Zj 0, so optimality and feasibility both are satisfied and now the solutions
Solution
X1 = 0
X2 = 2
Max Z = 2X1 + 2X2 = 2(0) + 2(1) = 4
Alternative Solution
X1 = 1
X2 = 1
Max Z = 2X1 + 2X2 = 2(1) + 2(1) = 4