Está en la página 1de 17

It is a special case of L.P.P.

when all the variables are

constrained to take only integer values in an Optimization

Production in Car Manufacturing Firm.
Vendors selection in the Supply Chain.

A Gomorian Cut is a linear constraint with the property

that it is strictly stronger than its Parent, but it does not

exclude any feasible integer solution of the LP problem
under consideration.
It is used, in conjunction with the Simplex Method, to

generate optimal solutions

programming problems (LIP).




Objective function
Max Z = 2X1 + 2X2

5X1 + 3X2 8
X1 + 2X2 4
X1, X2 0 and both are INTEGERS.

After the
S1, S2 0




Objective function
Max Z = 2X1 + 2X2 + 0S1 + 0S2
5X1 + 3X2 + S1
X1 + 2X2 +
S2 = 4
X1, X2 0 and both are integers.

Now we will solve this LPP Problem

with Simplex Method and if the
obtained Feasible Solution fails to
include the integer constraint then we
will introduce the GOMORIAN CUT to
get the desired result.

In this table, X2 will enter and S2 will depart.

In this table, X1 will enter and S1 will depart.

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.

Choose the largest fraction of XBi and name it as Fk.

In that row under the label of variables/slack/surplus, break the fractions into an integer +

fraction. If the fraction is negative then break into a negative integer and a positive fraction.

Constraint can be built as per this equation.

Putting the values to create Gomorian Constraint

Now, adding the Gomorian Slack Variable (where G1

will be 0.

+ =

Now we will use the Dual Simplex Method.

Mentioned below is the Initial Table.

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.

Putting the values to create Gomorian Constraint

Now, adding the Gomorian Slack Variable (where G2

will be 0)

+ =

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

also comply with the Integer constraint.

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