SlideShare a Scribd company logo
1 of 43
Download to read offline
Integer Programming Exclusive Including Gomory Method
Edited by Avinash Juriani
Management Science
Operations Research
by
Assoc. Prof. Sami Fethi
© 2007 Pearson Education
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 2
Chapter Topics
 Integer Programming (IP) Models
 Examples for Integer Programming (IP) Models
 Integer Programming Graphical Solution
 Traditional approaches to solving integer
programming problems
 Branch and Bound Method
 Gomory cutting plane Method
 Examples for Gomory cutting plane Method
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 3
Why used?
 The implicit assumption was that solutions could be
fractional or real numbers (i.e., non-integer) in the linear
programming models. However, non-integer solutions
are always practical.
 When only integer solutions are practical or logical, non-
integer solution values can be rounded off to the nearest
feasible integer values.
 For example, if the case is nail, it will cause little
concern considering 8000.4 nails as 8000 nails. Round
off makes the case cost only a few cents apeice.
 For example, if the case is a production of jet aircraft,
round off could affect profit or cost by million dollar
considering 7.4 jet airliners as 7 or 8.
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 4
Integer Programming Models: Types of Models
Total Integer Model: All decision variables required to have
integer solution values.
0-1 Integer Model: All decision variables required to have
integer values of zero or one.
Mixed Integer Model: Some of the decision variables (but
not all) required to have integer values.
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 5
Example 1: A Total Integer Model (1 of 2)
Machine shop obtaining new presses and lathes.
Marginal profitability: each press $100/day; each lathe
$150/day.
Resource constraints: $40,000, 200 sq. ft. floor space.
Machine purchase prices and space requirements:
Machine
Required Floor
Space
(sq. ft.)
Purchase
Price
Press
Lathe
15
30
$8,000
4,000
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 6
A Total Integer Model (2 of 2)
Integer Programming Model:
Maximize Z = $100x1 + $150x2
subject to:
8,000x1 + 4,000x2  $40,000
15x1 + 30x2  200 ft2
x1, x2  0 and integer
x1 = number of presses
x2 = number of lathes
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 7
Example 2: A Total Integer Model (1 of 1)
Integer Programming Model:
Maximize Z = 6x1 + 5x2 + 2x3
subject to:
10 x1 + 4 x2 + 2 x3  600
2 x1 + 5 x2 + 2 x3  800
x1, x2 ,,x3  0 and integer
x1 = 22
x2 = 0
x3 = 378
Z=888
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 8
Recreation facilities selection to maximize daily usage by
residents.
Resource constraints: $120,000 budget; 12 acres of land.
Selection constraint: either swimming pool or tennis center
(not both).
Data:
Recreation
Facility
Expected Usage
(people/day)
Cost ($)
Land
Requirement
(acres)
Swimming pool
Tennis Center
Athletic field
Gymnasium
300
90
400
150
35,000
10,000
25,000
90,000
4
2
7
3
Example 3 : A 0 - 1 Integer Model (1 of 2)
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 9
Integer Programming Model:
Maximize Z = 300x1 + 90x2 + 400x3 + 150x4
subject to:
$35,000x1 + 10,000x2 + 25,000x3 + 90,000x4  $120,000
4x1 + 2x2 + 7x3 + 3x4  12 acres
x1 + x2  1 facility
x1, x2, x3, x4 = 0 or 1
x1 = construction of a swimming pool
x2 = construction of a tennis center
x3 = construction of an athletic field
x4 = construction of a gymnasium
Example 3 : A 0 - 1 Integer Model (2 of 2)
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.10
Example 4 : A 0 - 1 Integer Model (1 of 1)
Integer Programming Model:
Maximize Z = 6x1 + 5x2 + 2x3
subject to:
10 x1 + 4 x2 + 2 x3  600
2 x1 + 5 x2 + 2 x3  800
x1, x2 ,,x3  0 or 1
x1 = 1
x2 = 1
x3 = 1
Z=13
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 11
Example 5: A Mixed Integer Model (1 of
2)
$250,000 available for investments providing greatest
return after one year.
Data:
Condominium cost $50,000/unit, $9,000 profit if sold
after one year.
Land cost $12,000/ acre, $1,500 profit if sold after one
year.
Municipal bond cost $8,000/bond, $1,000 profit if sold
after one year.
Only 4 condominiums, 15 acres of land, and 20
municipal bonds available.
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.12
Integer Programming Model:
Maximize Z = $9,000x1 + 1,500x2 + 1,000x3
subject to:
50,000x1 + 12,000x2 + 8,000x3  $250,000
x1  4 condominiums
x2  15 acres
x3  20 bonds
x2  0
x1, x3  0 and integer
x1 = condominiums purchased
x2 = acres of land purchased
x3 = bonds purchased
Example 5: A Mixed Integer Model (2 of 2)
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.13
Example 6 : A Mixed Integer Model (1 of 1)
Integer Programming Model:
Maximize Z = 6x1 + 5x2 + 2x3
subject to:
10 x1 + 4 x2 + 2 x3  600
2 x1 + 5 x2 + 2 x3  800
x1, x2 ,,x3  0
x1 = 22.2
x2 = 0
x3 = 377.8
Z=888.9
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.14
Integer Programming Example
Graphical Solution of Maximization Model
Maximize Z = $100x1 + $150x2
subject to:
8,000x1 + 4,000x2  $40,000
15x1 + 30x2  200 ft2
x1, x2  0 and integer
Optimal Solution:
Z = $1,055.56
x1 = 2.22 presses
x2 = 5.55 lathes
Figure 1 Feasible Solution Space with Integer Solution Points
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.15
Rounding non-integer solution values up to the
nearest integer value can result in an infeasible
solution.
A feasible solution is ensured by rounding down non-
integer solution values but may result in a less than
optimal (sub-optimal) solution.
Integer Programming Graphical Solution
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.16
Traditional approaches to solving integer programming problems
 Branch and Bound Method
Based on principle that total set of feasible solutions
can be partitioned into smaller subsets of solutions.
Smaller subsets evaluated until best solution is found.
Method is a tedious and complex mathematical
process.
This method can be used more easier If Excel or QM is
conducted.
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.17
Traditional approaches to solving integer programming problems
 Gomory cutting plane Method
In 1958 Ralph Gomory was the first individual to
develop a systematic (algorithmic) approach for solving
linear integer programming problems.
His method is an algebraic approach based on the
systematic addition of new constraints (or cuts), which
are satisfied by an integer solution but not by a
continous variable solution.
The idea of a cut is a new contstraint permits the new
feasible region to include all the feasible integer solution
for the original constraints, but it does not include the
optimal noninteger solution originally found.
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.18
Example 1- Gromory cutting plane Method
Integer Programming Model: Gromory’s fractional cut
Maximize Z = $ 3x1 + $ 5x2
subject to:
1 x1 + 4 x2  9
2 x1 + 3 x2  4
Non-negativity
x1, x2  0
Given the optimal noninteger solution to the problem:
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.19
Example 1- Gromory cutting plane Method
Find the optimal integer solution using Gomory’s cutting
plane method
3 5 0 0
C Pmix Quan X1 X2 S1 S2
5 X2 7/5 0 1 2/5 -1/5
3 X1 17/5 1 0 -3/5 4/5
Z 86/5 3 5 1/5 7/5
C-Z 0 0 -1/5 -7/5
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.20
Traditional approaches to solving integer programming problems
 Steps in Gomory cutting plane Method
To find the cut, we arbitrarily choose one of
noninteger variables in the optimal solution.
We choose X2 and need to rewrite this row with any
noninteger value in it express as the sum of an
integer and a non negative fraction less than 1.
The numbers in such process should be rewritten:
 4/3=1+1/3
 5/4=1+1/4
 2/3=0+2/3
 -2/3=-1+1/3
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.21
Traditional approaches to solving integer programming problems
 Steps in Gomory cutting plane Method
Initially, we write these values in the C row (1, 2/5, -1/5, 7/5)
as the sum of an integer and a nonnegative fraction less
than 1.
(1+0) X2+ (0+2/5) S1 + (-1+4/5) S2= (1+2/5)
Then we take all the integer coefficient to the right-hand
side:
2/5 S1 +4/5 S2= (2/5+1-1X2+1S2)
2/5 S1 +4/5 S2= (2/5+some integer )
Pmix Quan X1 X2 S1 S2
X2 7/5 0 1 2/5 -1/5
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.22
Traditional approaches to solving integer programming problems
 Steps in Gomory cutting plane Method
Omitting some integer part and write the cut eqn as follow:
The eqn must be greater than or equal 2/5.
2/5 S1 +4/5 S2 ≥ 2/5
For the sake of simplicity, we multiply the eqn by -1 and we
avoid having to deal with subtracted slack variables which
require an artificial variable.
- 2/5 S1 - 4/5 S2 ≤ - 2/5
- 2/5 S1 - 4/5 S2 + S3 = - 2/5 -This is the required cut.
Pmix Quan X1 X2 S1 S2
X2 7/5 0 1 2/5 -1/5
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.23
Example 1- Gromory cutting plane Method
We add the required cut in the new simplex tableau. Since C-Z
values are zero or negative, it is difficult to determine which
variable to bring into the solution. However, if there is any
negative number within the quantity column, the number should
leave from the system so S3 should be taken into account.
3 5 0 0 0
C Pmix Quan X1 X2 S1 S2 S3
5 X2 7/5 0 1 2/5 -1/5 0
3 X1 17/5 1 0 -3/5 4/5 0
S3 -2/5 0 0 -2/5 -4/5 1
Z 86/5 3 5 1/5 7/5 0
C-Z 0 0 -1/5 -7/5 0
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.24
Example 1- Gromory cutting plane Method
Now divide the negative values in the S3 row into the
corresponding values in C-Z row and bring in that variable which
has the smallest quotient:
S1=(- 1/5)/ (-2/5)= ½, S2=(- 7/5)/ (-1/4)= 7/4, S1 is the smallest
one so S1 comes in whilst S3 goes out.
3 5 0 0 0
C Pmix Quan X1 X2 S1 S2 S3
5 X2 7/5 0 1 2/5 -1/5 0
3 X1 17/5 1 0 -3/5 4/5 0
S3 -2/5* 0 0 -2/5 -4/5 1 Min
Z 86/5 3 5 1/5 7/5 0
C-Z 0 0 -1/5* -7/5* 0
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.25
Example 1- Gromory cutting plane Method
S3 is leaving from the system and S1 is entering
into the system.
New S1 =( 1, 0, 0, 1, 2, -5/2)
New X2 = old X2- key * New S1
1= 7/5-2/5*1
0= 0-2/5*0
1= 1-2/5*0
0= 2/5-2/5*1
−1= -1/5-2/5*2
1= 0-2/5*-5/2
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.26
Example 1- Gromory cutting plane Method
S3 is leaving from the system and S1 is entering into
the system
New S1 =( 1, 0, 0, 1, 2, -5/2)
New X1 = old X1- key * New S1
4= 17/5-(-3/5)*1
1= 1-(-3/5)*0
0= 0-(-3/5)*0
0= -3/5-(-3/5)*1
2= 4/5-(-3/5)*2
-3/2= 0-(-3/5)*-5/2
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.27
Example 1- Gromory cutting plane Method
Now, we know that the optimal solution has been reached. It
manufactures 4 tables and 1 chair and this uses all the hours
available except for 1 hour in department 1 since S1 has the
value 1 in the final solution. The profit earned by this optimal
integer solution is $ 17 which is only slightly lower than $86/5 ($
17.20) profit earned by the optimal noninteger solution in the first
Table:
3 5 0 0 0
C Pmix Quan X1 X2 S1 S2 S3
5 X2 1 0 1 0 -1 1
3 X1 4 1 0 0 2 -3/2
S1 1 0 0 1 2 -5/2
Z 17 3 5 0 1 1/2
C-Z 0 0 0 -1 -1/2
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.28
Example 2- Gromory cutting plane Method
Integer Programming Model: Gromory’s fractional cut
Maximize Z = $ 2x1 + $ 1x2
subject to:
2 x1 + 5 x2  17
3 x1 + 2 x2  10
Non-negativity
x1, x2  0 and integer
(a) Find the optimal integer solution using simplex method
(b) Find the optimal integer solution using Gomory’s cutting
plane method
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.29
Example 2- Gromory cutting plane Method
Find the optimal integer solution using both simplex and
Gomory’s cutting plane methods
2 1 0 0
C Pmix Quan X1 X2 S1 S2 Q/XS
0 S1 17 2 5 1 0 17/2
0 S2 10 1 0 0 1 10/1
Z 0 0 0 0 0 0
C-Z 2 1 0 0 0
Max
Min
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.30
Example 2- Gromory cutting plane Method
S2 is leaving from the system and X1 is entering into the
system.
New X1 =( 10/3, 3/3, 2/3, 0, 1/3)
New S1 = old S1- key * New X1
31/3= 17-2*10/3
0= 2-2*3/3
11/3= 5-2*2/3
1= 1-2*0
−2/3= 0-2*1/3
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.31
Example 2- Gromory cutting plane Method
This is the optimal solution, however the values in Quantity
column are noninteger. It seems that the simplex technique
applied in part (a) is not good enough so we need to use
Gromory cutting plane method in part (b).
2 1 0 0
C Pmix Quan X1 X2 S1 S2 Q/XS
0 S1 31/3 0 11/3 1 -2/3 -
2 X1 10/3 1 2/3 0 1/3 -
Z 20/3 2 4/3 0 2/3 -
C-Z 0 -1/3 0 -2/3 -
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.32
Example 2- Gromory cutting plane Method
 Steps in Gomory cutting plane Method
(1+0) X1+ (0+2/3) X2 + (0+1/3) S2= (3+1/3)
X1+2/3X2+1/3S2= 3+1/3
2/3 X2 +1/3 S2= 1/3+(3-1X1)
2/3 X2 +1/3 S2 = (1/3+some integer ) (multiply by -1
and add S3 variable).
-2/3 X2 -1/3 S2 + S3= -1/3
Pmix Quan X1 X2 S1 S2
X1 10/3 1 2/3 0 1/3
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.33
Example 2- Gromory cutting plane Method
Now divide the negative values in the S3 row into the
corresponding values in C-Z row and bring in that variable
which has the smallest quotient:
X2=(- 1/3)/ (-2/3)= ½, S2=(- 2/3)/ (-1/3)= 2, X2 is the smallest
one so X2 comes in whilst S3 goes out.
2 1 0 0 0
C Pmix Quan X1 X2 S1 S2 S3
2 X1 10/3 1 2/3 0 1/3 0
0 S1 31/3 0 11/3 1 -2/3 0
0 S3 -1/3 0 -2/3 0 -1/3 1
Z 20/3 2 4/3 0 2/3 0
C-Z 0 -1/3 0 -2/3 0
Min
Min Min
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.34
Example 2- Gromory cutting plane Method
S3 is leaving from the system and X2 is entering into the
system.
New X2 =( 1/2, 0, 1, 0, ½, -3/2)
New S1 = old S1- key * New X2
17/2= 31/3-11/3*1/2
0= 0-11/3*0
0= 11/3-11/3*1
1= 1-11/3*0
−5/2= -2/3-11/3*1/2
11/2= 0-11/3*-3/2
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.35
Example 2- Gromory cutting plane Method
This is the optimal solution, however the values in Quantity
column are noninteger so we need to use Gromory cutting
plane method in choosing the smallest value in Quantity
column. We therefore selected X2
2 1 0 0 0
C Pmix Quan X1 X2 S1 S2 S3
1 X2 1/2 0 1 0 1/2 -3/2
2 X1 3 1 0 0 0 1
0 S1 17/2 0 0 1 -5/2 11/2
Z 13/2 2 1 0 1/2 13/2
C-Z 0 0 0 -1/2 -1/2
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.36
Example 2- Gromory cutting plane Method
 Steps in Gomory cutting plane Method
(0) X1+ (1+0) X2 + (0) S1+ (0+1/2) S2+ (-1+1/2) S3 =(0+1/2)
X2+1/2 S2-S3-1/2 S3= 1/2
1/2 S2 -1/2 S3= (or ≥) 1/2+(1S3-1X2)
1/2 S2 -1/2 S3 ≥ (1/2+some integer ) (multiply by -1 and
add S4 variable).
-1/2 S2 +1/2 S3 ≤ -1/2
-1/2 S2 + 1/2 S3 + S4 = -1/2
Pmix Quan X1 X2 S1 S2 S3
X2 1/2 0 1 0 ½ -3/2
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.37
Example 2- Gromory cutting plane Method
Now divide the negative values in the S4 row into the corresponding values in C-Z row
and bring in that variable which has the smallest quotient:
S2=(- 1/2)/ (-1/2)= 1, S3=(- 1/2)/ (1/2)= -1, S2 is the smallest one so S2 comes in whilst
S4 goes out.
2 1 0 0 0 0
C Pmix Quan X1 X2 S1 S2 S3 S4
1 X2 1/2 0 1 0 1/2 -3/2 0
2 X1 3 1 0 0 0 1 0
0 S1 17/2 0 0 1 -5/2 11/2 0
0 S4 -1/2 0 0 0 -1/2 1/2 1 Min
Z 13/2 2 1 0 1/2 1/2 0
C-Z 0 0 0 -1/2 -1/2 0
Min
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.38
Example 2- Gromory cutting plane Method
S2 is leaving from the system and S4 is entering into the
system.
New S2 =( 1, 0, 0, 0, 1,-1 -2)
New X2 = old X2- key * New S2
0= 1/2-1/2*1
0= 0-1/2*0
1= 1-1/2*0
0= 0-1/2*0
0= 1/2-1/2*(1)
-½ = -3/2-1/2*(-1)
1= 0-1/2*(-2)
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.39
Example 2- Gromory cutting plane Method
S2 is leaving from the system and S4 is entering into the
system.
New S2 =( 1, 0, 0, 0, 1,-1 -2)
New X1 = old X1- key * New S2
3= 3-0*1
1= 1-0*0
0= 0-0*0
0= 0-0*0
0= 0-0*(1)
1 = 1-0*(-1)
0= 0-0*(-2)
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.40
Example 2- Gromory cutting plane Method
S2 is leaving from the system and S4 is entering into the
system.
New S2 =( 1, 0, 0, 0, 1,-1 -2)
New S1 = old S1- key * New S2
11= 17/2-(-5/2)*1
0= 0-(-5/2) *0
0= 0-(-5/2) *0
1= 1- (-5/2) *0
0= -5/2- (-5/2) *(1)
3 = 11/2-(-5/2) *(-1)
-5= 0-(-5/2) *(-2)
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.41
Example 2- Gromory cutting plane Method
2 1 0 0 0 0
C Pmix Quan X1 X2 S1 S2 S3 S4
1 X2 0 0 1 0 0 -1/2 1
2 X1 3 1 0 0 0 1 0
0 S1 11 0 0 1 0 3 -5
0 S2 1 0 0 0 1 -1 -2
Z 6 2 1 0 0 3/2 1
C-Z 0 -2 0 0 -3/2 -1
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.42
Example 2- Gromory cutting plane Method
Now, we know that the optimal solution has been reached. It
manufactures 3 mugs and 0 bowl and this uses all the hours and
materials available except for 11 hours of labor as well as 1 lb of
clay since S1 and S2 have the value 11 and 1 in the final solution
row. The profit earned by this optimal integer solution is $ 6 which
is only slightly lower than $20/3 ($ 6.66) profit earned by the
optimal noninteger solution in the first Table:
Ch 5: Integer programmimg
Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.43
End of chapter

More Related Content

What's hot

Kuhn-Tucker Conditions with non-negativity constraints.pptx
Kuhn-Tucker Conditions with non-negativity constraints.pptxKuhn-Tucker Conditions with non-negativity constraints.pptx
Kuhn-Tucker Conditions with non-negativity constraints.pptxssuserfecb3d
 
Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear ProgrammingInteger Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear ProgrammingSalah A. Skaik - MBA-PMP®
 
Linear programming using the simplex method
Linear programming using the simplex methodLinear programming using the simplex method
Linear programming using the simplex methodShivek Khurana
 
Goal programming 2011
Goal programming 2011Goal programming 2011
Goal programming 2011chaitu87
 
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditLinear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditPurnima Pandit
 
primal and dual problem
primal and dual problemprimal and dual problem
primal and dual problemYash Lad
 
Simplex Method
Simplex MethodSimplex Method
Simplex MethodSachin MK
 
Duality in Linear Programming Problem
Duality in Linear Programming ProblemDuality in Linear Programming Problem
Duality in Linear Programming ProblemRAVI PRASAD K.J.
 
Solving linear programming model by simplex method
Solving linear programming model by simplex methodSolving linear programming model by simplex method
Solving linear programming model by simplex methodRoshan Kumar Patel
 
NONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 IntroductionNONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 IntroductionOlympiad
 

What's hot (20)

Goal programming
Goal programmingGoal programming
Goal programming
 
Kuhn-Tucker Conditions with non-negativity constraints.pptx
Kuhn-Tucker Conditions with non-negativity constraints.pptxKuhn-Tucker Conditions with non-negativity constraints.pptx
Kuhn-Tucker Conditions with non-negativity constraints.pptx
 
Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear ProgrammingInteger Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear Programming
 
simplex method
simplex methodsimplex method
simplex method
 
Dual simplexmethod
Dual simplexmethodDual simplexmethod
Dual simplexmethod
 
Linear programming using the simplex method
Linear programming using the simplex methodLinear programming using the simplex method
Linear programming using the simplex method
 
Unit.2. linear programming
Unit.2. linear programmingUnit.2. linear programming
Unit.2. linear programming
 
Duality
DualityDuality
Duality
 
Linear Programming
Linear  ProgrammingLinear  Programming
Linear Programming
 
Simplex method
Simplex methodSimplex method
Simplex method
 
Goal programming 2011
Goal programming 2011Goal programming 2011
Goal programming 2011
 
Linear programing
Linear programingLinear programing
Linear programing
 
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditLinear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima Pandit
 
primal and dual problem
primal and dual problemprimal and dual problem
primal and dual problem
 
L20 Simplex Method
L20 Simplex MethodL20 Simplex Method
L20 Simplex Method
 
Simplex Method
Simplex MethodSimplex Method
Simplex Method
 
Duality in Linear Programming Problem
Duality in Linear Programming ProblemDuality in Linear Programming Problem
Duality in Linear Programming Problem
 
Solving linear programming model by simplex method
Solving linear programming model by simplex methodSolving linear programming model by simplex method
Solving linear programming model by simplex method
 
Linear Programming
Linear ProgrammingLinear Programming
Linear Programming
 
NONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 IntroductionNONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 Introduction
 

Similar to Integer Programming, Gomory

Chapter 6-INTEGER PROGRAMMING note.pdf
Chapter 6-INTEGER PROGRAMMING  note.pdfChapter 6-INTEGER PROGRAMMING  note.pdf
Chapter 6-INTEGER PROGRAMMING note.pdfTsegay Berhe
 
1 arithmetic
1 arithmetic1 arithmetic
1 arithmeticfyjordan9
 
A Real Life Application Of Linear Programming
A Real Life Application Of Linear ProgrammingA Real Life Application Of Linear Programming
A Real Life Application Of Linear ProgrammingTodd Turner
 
Lecture - Linear Programming.pdf
Lecture - Linear Programming.pdfLecture - Linear Programming.pdf
Lecture - Linear Programming.pdflucky141651
 
Universal Algebras Associative Ring ( R )
Universal Algebras Associative Ring ( R )Universal Algebras Associative Ring ( R )
Universal Algebras Associative Ring ( R )Stephanie Benjamin
 
Mathematical optimization and python
Mathematical optimization and pythonMathematical optimization and python
Mathematical optimization and pythonOpen-IT
 
New very very interesting Ppt best notesnew.pdf
New very very interesting Ppt best notesnew.pdfNew very very interesting Ppt best notesnew.pdf
New very very interesting Ppt best notesnew.pdfMUKESHKUMAR601613
 
IE-301_OptionalProject_Group2_Report
IE-301_OptionalProject_Group2_ReportIE-301_OptionalProject_Group2_Report
IE-301_OptionalProject_Group2_ReportSarp Uzel
 
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSA HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSijfcstjournal
 
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSA HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSijfcstjournal
 
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)LP linear programming (summary) (5s)
LP linear programming (summary) (5s)Dionísio Carmo-Neto
 
Introduction to code optimization by dipankar
Introduction to code optimization by dipankarIntroduction to code optimization by dipankar
Introduction to code optimization by dipankarDipankar Nalui
 
Quantum Business in Japanese Market
Quantum Business in Japanese MarketQuantum Business in Japanese Market
Quantum Business in Japanese MarketYuichiro MInato
 

Similar to Integer Programming, Gomory (20)

Chapter 6-INTEGER PROGRAMMING note.pdf
Chapter 6-INTEGER PROGRAMMING  note.pdfChapter 6-INTEGER PROGRAMMING  note.pdf
Chapter 6-INTEGER PROGRAMMING note.pdf
 
Or ch2 (2)
Or ch2 (2)Or ch2 (2)
Or ch2 (2)
 
1 arithmetic
1 arithmetic1 arithmetic
1 arithmetic
 
A Real Life Application Of Linear Programming
A Real Life Application Of Linear ProgrammingA Real Life Application Of Linear Programming
A Real Life Application Of Linear Programming
 
Lecture - Linear Programming.pdf
Lecture - Linear Programming.pdfLecture - Linear Programming.pdf
Lecture - Linear Programming.pdf
 
Universal Algebras Associative Ring ( R )
Universal Algebras Associative Ring ( R )Universal Algebras Associative Ring ( R )
Universal Algebras Associative Ring ( R )
 
Mathematical optimization and python
Mathematical optimization and pythonMathematical optimization and python
Mathematical optimization and python
 
New very very interesting Ppt best notesnew.pdf
New very very interesting Ppt best notesnew.pdfNew very very interesting Ppt best notesnew.pdf
New very very interesting Ppt best notesnew.pdf
 
IE-301_OptionalProject_Group2_Report
IE-301_OptionalProject_Group2_ReportIE-301_OptionalProject_Group2_Report
IE-301_OptionalProject_Group2_Report
 
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSA HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
 
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSA HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
 
REvit training
REvit trainingREvit training
REvit training
 
Ees 300
Ees 300Ees 300
Ees 300
 
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)LP linear programming (summary) (5s)
LP linear programming (summary) (5s)
 
Introduction to code optimization by dipankar
Introduction to code optimization by dipankarIntroduction to code optimization by dipankar
Introduction to code optimization by dipankar
 
sheet6.pdf
sheet6.pdfsheet6.pdf
sheet6.pdf
 
doc6.pdf
doc6.pdfdoc6.pdf
doc6.pdf
 
paper6.pdf
paper6.pdfpaper6.pdf
paper6.pdf
 
lecture5.pdf
lecture5.pdflecture5.pdf
lecture5.pdf
 
Quantum Business in Japanese Market
Quantum Business in Japanese MarketQuantum Business in Japanese Market
Quantum Business in Japanese Market
 

More from AVINASH JURIANI

Matlab Master Class-Day 28.Learn (1).pptx
Matlab Master Class-Day 28.Learn (1).pptxMatlab Master Class-Day 28.Learn (1).pptx
Matlab Master Class-Day 28.Learn (1).pptxAVINASH JURIANI
 
Internship Training Report
Internship Training ReportInternship Training Report
Internship Training ReportAVINASH JURIANI
 
Transformations advanced
Transformations advancedTransformations advanced
Transformations advancedAVINASH JURIANI
 
Ict in-schools-inspectorate-evaluation-studies
Ict in-schools-inspectorate-evaluation-studiesIct in-schools-inspectorate-evaluation-studies
Ict in-schools-inspectorate-evaluation-studiesAVINASH JURIANI
 
Plate Cutting Error in Fabrication Shop & their Remedial Measure with Indust...
Plate Cutting Error in Fabrication Shop & their  Remedial Measure with Indust...Plate Cutting Error in Fabrication Shop & their  Remedial Measure with Indust...
Plate Cutting Error in Fabrication Shop & their Remedial Measure with Indust...AVINASH JURIANI
 
casting sand, properties graphs
casting sand, properties graphscasting sand, properties graphs
casting sand, properties graphsAVINASH JURIANI
 
Electrochemical Machining
Electrochemical MachiningElectrochemical Machining
Electrochemical MachiningAVINASH JURIANI
 
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...AVINASH JURIANI
 
Tungsten Inert Gas Welding
Tungsten Inert Gas WeldingTungsten Inert Gas Welding
Tungsten Inert Gas WeldingAVINASH JURIANI
 
Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...
Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...
Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...AVINASH JURIANI
 
OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...
OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...
OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...AVINASH JURIANI
 
MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...
MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...
MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...AVINASH JURIANI
 

More from AVINASH JURIANI (16)

Matlab Master Class-Day 28.Learn (1).pptx
Matlab Master Class-Day 28.Learn (1).pptxMatlab Master Class-Day 28.Learn (1).pptx
Matlab Master Class-Day 28.Learn (1).pptx
 
Internship Training Report
Internship Training ReportInternship Training Report
Internship Training Report
 
Transformations advanced
Transformations advancedTransformations advanced
Transformations advanced
 
Robotics done
Robotics doneRobotics done
Robotics done
 
Ict in-schools-inspectorate-evaluation-studies
Ict in-schools-inspectorate-evaluation-studiesIct in-schools-inspectorate-evaluation-studies
Ict in-schools-inspectorate-evaluation-studies
 
IPV6 INTRODUCTION
IPV6 INTRODUCTIONIPV6 INTRODUCTION
IPV6 INTRODUCTION
 
Plate Cutting Error in Fabrication Shop & their Remedial Measure with Indust...
Plate Cutting Error in Fabrication Shop & their  Remedial Measure with Indust...Plate Cutting Error in Fabrication Shop & their  Remedial Measure with Indust...
Plate Cutting Error in Fabrication Shop & their Remedial Measure with Indust...
 
casting sand, properties graphs
casting sand, properties graphscasting sand, properties graphs
casting sand, properties graphs
 
Electrochemical Machining
Electrochemical MachiningElectrochemical Machining
Electrochemical Machining
 
Hot Rolling Process
Hot Rolling ProcessHot Rolling Process
Hot Rolling Process
 
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...
 
Slotting machine
Slotting machineSlotting machine
Slotting machine
 
Tungsten Inert Gas Welding
Tungsten Inert Gas WeldingTungsten Inert Gas Welding
Tungsten Inert Gas Welding
 
Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...
Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...
Casting Defects Analysis in Foundry and Their Remedial Measures with Industri...
 
OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...
OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...
OPTIMIZATION OF PLATE CUTTING LAYOUT TO MINIMIZE OFFCUT - SCRAP USING EXPERTI...
 
MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...
MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...
MULTIOBJECTIVE OPTIMIZATION OF MACHINING PARAMETERSFOR C-65 MATERIAL USING TA...
 

Recently uploaded

autonomous_vehicle_working_paper_01072020-_508_compliant.pdf
autonomous_vehicle_working_paper_01072020-_508_compliant.pdfautonomous_vehicle_working_paper_01072020-_508_compliant.pdf
autonomous_vehicle_working_paper_01072020-_508_compliant.pdfPandurangGurakhe
 
PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...
PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...
PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...Luuk Brederode
 
Tekom Netherlands | The evolving landscape of Simplified Technical English b...
Tekom Netherlands | The evolving landscape of Simplified Technical English  b...Tekom Netherlands | The evolving landscape of Simplified Technical English  b...
Tekom Netherlands | The evolving landscape of Simplified Technical English b...Shumin Chen
 
Conventional vs Modern method (Philosophies) of Tunneling-re.pptx
Conventional vs Modern method (Philosophies) of Tunneling-re.pptxConventional vs Modern method (Philosophies) of Tunneling-re.pptx
Conventional vs Modern method (Philosophies) of Tunneling-re.pptxSAQIB KHURSHEED WANI
 
عناصر نباتية PDF.pdf architecture engineering
عناصر نباتية PDF.pdf architecture engineeringعناصر نباتية PDF.pdf architecture engineering
عناصر نباتية PDF.pdf architecture engineeringmennamohamed200y
 
Evaluation Methods for Social XR Experiences
Evaluation Methods for Social XR ExperiencesEvaluation Methods for Social XR Experiences
Evaluation Methods for Social XR ExperiencesMark Billinghurst
 
A brief about Jeypore Sub-station Presentation
A brief about Jeypore Sub-station PresentationA brief about Jeypore Sub-station Presentation
A brief about Jeypore Sub-station PresentationJeyporess2021
 
pulse modulation technique (Pulse code modulation).pptx
pulse modulation technique (Pulse code modulation).pptxpulse modulation technique (Pulse code modulation).pptx
pulse modulation technique (Pulse code modulation).pptxNishanth Asmi
 
Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)
Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)
Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)Mizan Rahman
 
The Art of Cloud Native Defense on Kubernetes
The Art of Cloud Native Defense on KubernetesThe Art of Cloud Native Defense on Kubernetes
The Art of Cloud Native Defense on KubernetesJacopo Nardiello
 
Introduction to Data Structures .
Introduction to Data Structures        .Introduction to Data Structures        .
Introduction to Data Structures .Ashutosh Satapathy
 
Advanced Additive Manufacturing by Sumanth A.pptx
Advanced Additive Manufacturing by Sumanth A.pptxAdvanced Additive Manufacturing by Sumanth A.pptx
Advanced Additive Manufacturing by Sumanth A.pptxSumanth A
 
Chapter 2 Canal Falls at Mnnit Allahabad .pptx
Chapter 2 Canal Falls at Mnnit Allahabad .pptxChapter 2 Canal Falls at Mnnit Allahabad .pptx
Chapter 2 Canal Falls at Mnnit Allahabad .pptxButcher771
 
Support nodes for large-span coal storage structures
Support nodes for large-span coal storage structuresSupport nodes for large-span coal storage structures
Support nodes for large-span coal storage structureswendy cai
 
Artificial organ courses Hussein L1-C2.pptx
Artificial organ courses Hussein  L1-C2.pptxArtificial organ courses Hussein  L1-C2.pptx
Artificial organ courses Hussein L1-C2.pptxHusseinMishbak
 
Road to GDSC (Become the next GDSC lead)
Road to GDSC (Become the next GDSC lead)Road to GDSC (Become the next GDSC lead)
Road to GDSC (Become the next GDSC lead)GDSCNiT
 
This chapter gives an outline of the security.
This chapter gives an outline of the security.This chapter gives an outline of the security.
This chapter gives an outline of the security.RoshniIsrani1
 
Field Report on present condition of Ward 1 and Ward 2 of Pabna Municipality
Field Report on present condition of Ward 1 and Ward 2 of Pabna MunicipalityField Report on present condition of Ward 1 and Ward 2 of Pabna Municipality
Field Report on present condition of Ward 1 and Ward 2 of Pabna MunicipalityMorshed Ahmed Rahath
 

Recently uploaded (20)

autonomous_vehicle_working_paper_01072020-_508_compliant.pdf
autonomous_vehicle_working_paper_01072020-_508_compliant.pdfautonomous_vehicle_working_paper_01072020-_508_compliant.pdf
autonomous_vehicle_working_paper_01072020-_508_compliant.pdf
 
PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...
PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...
PhD summary of Luuk Brederode, presented at 2023-10-17 to Veitch Lister Consu...
 
Tekom Netherlands | The evolving landscape of Simplified Technical English b...
Tekom Netherlands | The evolving landscape of Simplified Technical English  b...Tekom Netherlands | The evolving landscape of Simplified Technical English  b...
Tekom Netherlands | The evolving landscape of Simplified Technical English b...
 
Caltrans view on recycling of in-place asphalt pavements
Caltrans view on recycling of in-place asphalt pavementsCaltrans view on recycling of in-place asphalt pavements
Caltrans view on recycling of in-place asphalt pavements
 
Conventional vs Modern method (Philosophies) of Tunneling-re.pptx
Conventional vs Modern method (Philosophies) of Tunneling-re.pptxConventional vs Modern method (Philosophies) of Tunneling-re.pptx
Conventional vs Modern method (Philosophies) of Tunneling-re.pptx
 
عناصر نباتية PDF.pdf architecture engineering
عناصر نباتية PDF.pdf architecture engineeringعناصر نباتية PDF.pdf architecture engineering
عناصر نباتية PDF.pdf architecture engineering
 
Evaluation Methods for Social XR Experiences
Evaluation Methods for Social XR ExperiencesEvaluation Methods for Social XR Experiences
Evaluation Methods for Social XR Experiences
 
A brief about Jeypore Sub-station Presentation
A brief about Jeypore Sub-station PresentationA brief about Jeypore Sub-station Presentation
A brief about Jeypore Sub-station Presentation
 
pulse modulation technique (Pulse code modulation).pptx
pulse modulation technique (Pulse code modulation).pptxpulse modulation technique (Pulse code modulation).pptx
pulse modulation technique (Pulse code modulation).pptx
 
Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)
Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)
Fabrics Finishing Manual ( Arkey Knit Dyeing Mills Ltd)
 
The Art of Cloud Native Defense on Kubernetes
The Art of Cloud Native Defense on KubernetesThe Art of Cloud Native Defense on Kubernetes
The Art of Cloud Native Defense on Kubernetes
 
Introduction to Data Structures .
Introduction to Data Structures        .Introduction to Data Structures        .
Introduction to Data Structures .
 
Advanced Additive Manufacturing by Sumanth A.pptx
Advanced Additive Manufacturing by Sumanth A.pptxAdvanced Additive Manufacturing by Sumanth A.pptx
Advanced Additive Manufacturing by Sumanth A.pptx
 
Industry perspective on cold in-place recycling
Industry perspective on cold in-place recyclingIndustry perspective on cold in-place recycling
Industry perspective on cold in-place recycling
 
Chapter 2 Canal Falls at Mnnit Allahabad .pptx
Chapter 2 Canal Falls at Mnnit Allahabad .pptxChapter 2 Canal Falls at Mnnit Allahabad .pptx
Chapter 2 Canal Falls at Mnnit Allahabad .pptx
 
Support nodes for large-span coal storage structures
Support nodes for large-span coal storage structuresSupport nodes for large-span coal storage structures
Support nodes for large-span coal storage structures
 
Artificial organ courses Hussein L1-C2.pptx
Artificial organ courses Hussein  L1-C2.pptxArtificial organ courses Hussein  L1-C2.pptx
Artificial organ courses Hussein L1-C2.pptx
 
Road to GDSC (Become the next GDSC lead)
Road to GDSC (Become the next GDSC lead)Road to GDSC (Become the next GDSC lead)
Road to GDSC (Become the next GDSC lead)
 
This chapter gives an outline of the security.
This chapter gives an outline of the security.This chapter gives an outline of the security.
This chapter gives an outline of the security.
 
Field Report on present condition of Ward 1 and Ward 2 of Pabna Municipality
Field Report on present condition of Ward 1 and Ward 2 of Pabna MunicipalityField Report on present condition of Ward 1 and Ward 2 of Pabna Municipality
Field Report on present condition of Ward 1 and Ward 2 of Pabna Municipality
 

Integer Programming, Gomory

  • 1. Integer Programming Exclusive Including Gomory Method Edited by Avinash Juriani Management Science Operations Research by Assoc. Prof. Sami Fethi © 2007 Pearson Education
  • 2. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 2 Chapter Topics  Integer Programming (IP) Models  Examples for Integer Programming (IP) Models  Integer Programming Graphical Solution  Traditional approaches to solving integer programming problems  Branch and Bound Method  Gomory cutting plane Method  Examples for Gomory cutting plane Method
  • 3. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 3 Why used?  The implicit assumption was that solutions could be fractional or real numbers (i.e., non-integer) in the linear programming models. However, non-integer solutions are always practical.  When only integer solutions are practical or logical, non- integer solution values can be rounded off to the nearest feasible integer values.  For example, if the case is nail, it will cause little concern considering 8000.4 nails as 8000 nails. Round off makes the case cost only a few cents apeice.  For example, if the case is a production of jet aircraft, round off could affect profit or cost by million dollar considering 7.4 jet airliners as 7 or 8.
  • 4. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 4 Integer Programming Models: Types of Models Total Integer Model: All decision variables required to have integer solution values. 0-1 Integer Model: All decision variables required to have integer values of zero or one. Mixed Integer Model: Some of the decision variables (but not all) required to have integer values.
  • 5. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 5 Example 1: A Total Integer Model (1 of 2) Machine shop obtaining new presses and lathes. Marginal profitability: each press $100/day; each lathe $150/day. Resource constraints: $40,000, 200 sq. ft. floor space. Machine purchase prices and space requirements: Machine Required Floor Space (sq. ft.) Purchase Price Press Lathe 15 30 $8,000 4,000
  • 6. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 6 A Total Integer Model (2 of 2) Integer Programming Model: Maximize Z = $100x1 + $150x2 subject to: 8,000x1 + 4,000x2  $40,000 15x1 + 30x2  200 ft2 x1, x2  0 and integer x1 = number of presses x2 = number of lathes
  • 7. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 7 Example 2: A Total Integer Model (1 of 1) Integer Programming Model: Maximize Z = 6x1 + 5x2 + 2x3 subject to: 10 x1 + 4 x2 + 2 x3  600 2 x1 + 5 x2 + 2 x3  800 x1, x2 ,,x3  0 and integer x1 = 22 x2 = 0 x3 = 378 Z=888
  • 8. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 8 Recreation facilities selection to maximize daily usage by residents. Resource constraints: $120,000 budget; 12 acres of land. Selection constraint: either swimming pool or tennis center (not both). Data: Recreation Facility Expected Usage (people/day) Cost ($) Land Requirement (acres) Swimming pool Tennis Center Athletic field Gymnasium 300 90 400 150 35,000 10,000 25,000 90,000 4 2 7 3 Example 3 : A 0 - 1 Integer Model (1 of 2)
  • 9. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 9 Integer Programming Model: Maximize Z = 300x1 + 90x2 + 400x3 + 150x4 subject to: $35,000x1 + 10,000x2 + 25,000x3 + 90,000x4  $120,000 4x1 + 2x2 + 7x3 + 3x4  12 acres x1 + x2  1 facility x1, x2, x3, x4 = 0 or 1 x1 = construction of a swimming pool x2 = construction of a tennis center x3 = construction of an athletic field x4 = construction of a gymnasium Example 3 : A 0 - 1 Integer Model (2 of 2)
  • 10. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.10 Example 4 : A 0 - 1 Integer Model (1 of 1) Integer Programming Model: Maximize Z = 6x1 + 5x2 + 2x3 subject to: 10 x1 + 4 x2 + 2 x3  600 2 x1 + 5 x2 + 2 x3  800 x1, x2 ,,x3  0 or 1 x1 = 1 x2 = 1 x3 = 1 Z=13
  • 11. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved. 11 Example 5: A Mixed Integer Model (1 of 2) $250,000 available for investments providing greatest return after one year. Data: Condominium cost $50,000/unit, $9,000 profit if sold after one year. Land cost $12,000/ acre, $1,500 profit if sold after one year. Municipal bond cost $8,000/bond, $1,000 profit if sold after one year. Only 4 condominiums, 15 acres of land, and 20 municipal bonds available.
  • 12. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.12 Integer Programming Model: Maximize Z = $9,000x1 + 1,500x2 + 1,000x3 subject to: 50,000x1 + 12,000x2 + 8,000x3  $250,000 x1  4 condominiums x2  15 acres x3  20 bonds x2  0 x1, x3  0 and integer x1 = condominiums purchased x2 = acres of land purchased x3 = bonds purchased Example 5: A Mixed Integer Model (2 of 2)
  • 13. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.13 Example 6 : A Mixed Integer Model (1 of 1) Integer Programming Model: Maximize Z = 6x1 + 5x2 + 2x3 subject to: 10 x1 + 4 x2 + 2 x3  600 2 x1 + 5 x2 + 2 x3  800 x1, x2 ,,x3  0 x1 = 22.2 x2 = 0 x3 = 377.8 Z=888.9
  • 14. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.14 Integer Programming Example Graphical Solution of Maximization Model Maximize Z = $100x1 + $150x2 subject to: 8,000x1 + 4,000x2  $40,000 15x1 + 30x2  200 ft2 x1, x2  0 and integer Optimal Solution: Z = $1,055.56 x1 = 2.22 presses x2 = 5.55 lathes Figure 1 Feasible Solution Space with Integer Solution Points
  • 15. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.15 Rounding non-integer solution values up to the nearest integer value can result in an infeasible solution. A feasible solution is ensured by rounding down non- integer solution values but may result in a less than optimal (sub-optimal) solution. Integer Programming Graphical Solution
  • 16. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.16 Traditional approaches to solving integer programming problems  Branch and Bound Method Based on principle that total set of feasible solutions can be partitioned into smaller subsets of solutions. Smaller subsets evaluated until best solution is found. Method is a tedious and complex mathematical process. This method can be used more easier If Excel or QM is conducted.
  • 17. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.17 Traditional approaches to solving integer programming problems  Gomory cutting plane Method In 1958 Ralph Gomory was the first individual to develop a systematic (algorithmic) approach for solving linear integer programming problems. His method is an algebraic approach based on the systematic addition of new constraints (or cuts), which are satisfied by an integer solution but not by a continous variable solution. The idea of a cut is a new contstraint permits the new feasible region to include all the feasible integer solution for the original constraints, but it does not include the optimal noninteger solution originally found.
  • 18. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.18 Example 1- Gromory cutting plane Method Integer Programming Model: Gromory’s fractional cut Maximize Z = $ 3x1 + $ 5x2 subject to: 1 x1 + 4 x2  9 2 x1 + 3 x2  4 Non-negativity x1, x2  0 Given the optimal noninteger solution to the problem:
  • 19. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.19 Example 1- Gromory cutting plane Method Find the optimal integer solution using Gomory’s cutting plane method 3 5 0 0 C Pmix Quan X1 X2 S1 S2 5 X2 7/5 0 1 2/5 -1/5 3 X1 17/5 1 0 -3/5 4/5 Z 86/5 3 5 1/5 7/5 C-Z 0 0 -1/5 -7/5
  • 20. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.20 Traditional approaches to solving integer programming problems  Steps in Gomory cutting plane Method To find the cut, we arbitrarily choose one of noninteger variables in the optimal solution. We choose X2 and need to rewrite this row with any noninteger value in it express as the sum of an integer and a non negative fraction less than 1. The numbers in such process should be rewritten:  4/3=1+1/3  5/4=1+1/4  2/3=0+2/3  -2/3=-1+1/3
  • 21. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.21 Traditional approaches to solving integer programming problems  Steps in Gomory cutting plane Method Initially, we write these values in the C row (1, 2/5, -1/5, 7/5) as the sum of an integer and a nonnegative fraction less than 1. (1+0) X2+ (0+2/5) S1 + (-1+4/5) S2= (1+2/5) Then we take all the integer coefficient to the right-hand side: 2/5 S1 +4/5 S2= (2/5+1-1X2+1S2) 2/5 S1 +4/5 S2= (2/5+some integer ) Pmix Quan X1 X2 S1 S2 X2 7/5 0 1 2/5 -1/5
  • 22. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.22 Traditional approaches to solving integer programming problems  Steps in Gomory cutting plane Method Omitting some integer part and write the cut eqn as follow: The eqn must be greater than or equal 2/5. 2/5 S1 +4/5 S2 ≥ 2/5 For the sake of simplicity, we multiply the eqn by -1 and we avoid having to deal with subtracted slack variables which require an artificial variable. - 2/5 S1 - 4/5 S2 ≤ - 2/5 - 2/5 S1 - 4/5 S2 + S3 = - 2/5 -This is the required cut. Pmix Quan X1 X2 S1 S2 X2 7/5 0 1 2/5 -1/5
  • 23. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.23 Example 1- Gromory cutting plane Method We add the required cut in the new simplex tableau. Since C-Z values are zero or negative, it is difficult to determine which variable to bring into the solution. However, if there is any negative number within the quantity column, the number should leave from the system so S3 should be taken into account. 3 5 0 0 0 C Pmix Quan X1 X2 S1 S2 S3 5 X2 7/5 0 1 2/5 -1/5 0 3 X1 17/5 1 0 -3/5 4/5 0 S3 -2/5 0 0 -2/5 -4/5 1 Z 86/5 3 5 1/5 7/5 0 C-Z 0 0 -1/5 -7/5 0
  • 24. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.24 Example 1- Gromory cutting plane Method Now divide the negative values in the S3 row into the corresponding values in C-Z row and bring in that variable which has the smallest quotient: S1=(- 1/5)/ (-2/5)= ½, S2=(- 7/5)/ (-1/4)= 7/4, S1 is the smallest one so S1 comes in whilst S3 goes out. 3 5 0 0 0 C Pmix Quan X1 X2 S1 S2 S3 5 X2 7/5 0 1 2/5 -1/5 0 3 X1 17/5 1 0 -3/5 4/5 0 S3 -2/5* 0 0 -2/5 -4/5 1 Min Z 86/5 3 5 1/5 7/5 0 C-Z 0 0 -1/5* -7/5* 0
  • 25. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.25 Example 1- Gromory cutting plane Method S3 is leaving from the system and S1 is entering into the system. New S1 =( 1, 0, 0, 1, 2, -5/2) New X2 = old X2- key * New S1 1= 7/5-2/5*1 0= 0-2/5*0 1= 1-2/5*0 0= 2/5-2/5*1 −1= -1/5-2/5*2 1= 0-2/5*-5/2
  • 26. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.26 Example 1- Gromory cutting plane Method S3 is leaving from the system and S1 is entering into the system New S1 =( 1, 0, 0, 1, 2, -5/2) New X1 = old X1- key * New S1 4= 17/5-(-3/5)*1 1= 1-(-3/5)*0 0= 0-(-3/5)*0 0= -3/5-(-3/5)*1 2= 4/5-(-3/5)*2 -3/2= 0-(-3/5)*-5/2
  • 27. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.27 Example 1- Gromory cutting plane Method Now, we know that the optimal solution has been reached. It manufactures 4 tables and 1 chair and this uses all the hours available except for 1 hour in department 1 since S1 has the value 1 in the final solution. The profit earned by this optimal integer solution is $ 17 which is only slightly lower than $86/5 ($ 17.20) profit earned by the optimal noninteger solution in the first Table: 3 5 0 0 0 C Pmix Quan X1 X2 S1 S2 S3 5 X2 1 0 1 0 -1 1 3 X1 4 1 0 0 2 -3/2 S1 1 0 0 1 2 -5/2 Z 17 3 5 0 1 1/2 C-Z 0 0 0 -1 -1/2
  • 28. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.28 Example 2- Gromory cutting plane Method Integer Programming Model: Gromory’s fractional cut Maximize Z = $ 2x1 + $ 1x2 subject to: 2 x1 + 5 x2  17 3 x1 + 2 x2  10 Non-negativity x1, x2  0 and integer (a) Find the optimal integer solution using simplex method (b) Find the optimal integer solution using Gomory’s cutting plane method
  • 29. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.29 Example 2- Gromory cutting plane Method Find the optimal integer solution using both simplex and Gomory’s cutting plane methods 2 1 0 0 C Pmix Quan X1 X2 S1 S2 Q/XS 0 S1 17 2 5 1 0 17/2 0 S2 10 1 0 0 1 10/1 Z 0 0 0 0 0 0 C-Z 2 1 0 0 0 Max Min
  • 30. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.30 Example 2- Gromory cutting plane Method S2 is leaving from the system and X1 is entering into the system. New X1 =( 10/3, 3/3, 2/3, 0, 1/3) New S1 = old S1- key * New X1 31/3= 17-2*10/3 0= 2-2*3/3 11/3= 5-2*2/3 1= 1-2*0 −2/3= 0-2*1/3
  • 31. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.31 Example 2- Gromory cutting plane Method This is the optimal solution, however the values in Quantity column are noninteger. It seems that the simplex technique applied in part (a) is not good enough so we need to use Gromory cutting plane method in part (b). 2 1 0 0 C Pmix Quan X1 X2 S1 S2 Q/XS 0 S1 31/3 0 11/3 1 -2/3 - 2 X1 10/3 1 2/3 0 1/3 - Z 20/3 2 4/3 0 2/3 - C-Z 0 -1/3 0 -2/3 -
  • 32. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.32 Example 2- Gromory cutting plane Method  Steps in Gomory cutting plane Method (1+0) X1+ (0+2/3) X2 + (0+1/3) S2= (3+1/3) X1+2/3X2+1/3S2= 3+1/3 2/3 X2 +1/3 S2= 1/3+(3-1X1) 2/3 X2 +1/3 S2 = (1/3+some integer ) (multiply by -1 and add S3 variable). -2/3 X2 -1/3 S2 + S3= -1/3 Pmix Quan X1 X2 S1 S2 X1 10/3 1 2/3 0 1/3
  • 33. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.33 Example 2- Gromory cutting plane Method Now divide the negative values in the S3 row into the corresponding values in C-Z row and bring in that variable which has the smallest quotient: X2=(- 1/3)/ (-2/3)= ½, S2=(- 2/3)/ (-1/3)= 2, X2 is the smallest one so X2 comes in whilst S3 goes out. 2 1 0 0 0 C Pmix Quan X1 X2 S1 S2 S3 2 X1 10/3 1 2/3 0 1/3 0 0 S1 31/3 0 11/3 1 -2/3 0 0 S3 -1/3 0 -2/3 0 -1/3 1 Z 20/3 2 4/3 0 2/3 0 C-Z 0 -1/3 0 -2/3 0 Min Min Min
  • 34. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.34 Example 2- Gromory cutting plane Method S3 is leaving from the system and X2 is entering into the system. New X2 =( 1/2, 0, 1, 0, ½, -3/2) New S1 = old S1- key * New X2 17/2= 31/3-11/3*1/2 0= 0-11/3*0 0= 11/3-11/3*1 1= 1-11/3*0 −5/2= -2/3-11/3*1/2 11/2= 0-11/3*-3/2
  • 35. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.35 Example 2- Gromory cutting plane Method This is the optimal solution, however the values in Quantity column are noninteger so we need to use Gromory cutting plane method in choosing the smallest value in Quantity column. We therefore selected X2 2 1 0 0 0 C Pmix Quan X1 X2 S1 S2 S3 1 X2 1/2 0 1 0 1/2 -3/2 2 X1 3 1 0 0 0 1 0 S1 17/2 0 0 1 -5/2 11/2 Z 13/2 2 1 0 1/2 13/2 C-Z 0 0 0 -1/2 -1/2
  • 36. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.36 Example 2- Gromory cutting plane Method  Steps in Gomory cutting plane Method (0) X1+ (1+0) X2 + (0) S1+ (0+1/2) S2+ (-1+1/2) S3 =(0+1/2) X2+1/2 S2-S3-1/2 S3= 1/2 1/2 S2 -1/2 S3= (or ≥) 1/2+(1S3-1X2) 1/2 S2 -1/2 S3 ≥ (1/2+some integer ) (multiply by -1 and add S4 variable). -1/2 S2 +1/2 S3 ≤ -1/2 -1/2 S2 + 1/2 S3 + S4 = -1/2 Pmix Quan X1 X2 S1 S2 S3 X2 1/2 0 1 0 ½ -3/2
  • 37. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.37 Example 2- Gromory cutting plane Method Now divide the negative values in the S4 row into the corresponding values in C-Z row and bring in that variable which has the smallest quotient: S2=(- 1/2)/ (-1/2)= 1, S3=(- 1/2)/ (1/2)= -1, S2 is the smallest one so S2 comes in whilst S4 goes out. 2 1 0 0 0 0 C Pmix Quan X1 X2 S1 S2 S3 S4 1 X2 1/2 0 1 0 1/2 -3/2 0 2 X1 3 1 0 0 0 1 0 0 S1 17/2 0 0 1 -5/2 11/2 0 0 S4 -1/2 0 0 0 -1/2 1/2 1 Min Z 13/2 2 1 0 1/2 1/2 0 C-Z 0 0 0 -1/2 -1/2 0 Min
  • 38. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.38 Example 2- Gromory cutting plane Method S2 is leaving from the system and S4 is entering into the system. New S2 =( 1, 0, 0, 0, 1,-1 -2) New X2 = old X2- key * New S2 0= 1/2-1/2*1 0= 0-1/2*0 1= 1-1/2*0 0= 0-1/2*0 0= 1/2-1/2*(1) -½ = -3/2-1/2*(-1) 1= 0-1/2*(-2)
  • 39. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.39 Example 2- Gromory cutting plane Method S2 is leaving from the system and S4 is entering into the system. New S2 =( 1, 0, 0, 0, 1,-1 -2) New X1 = old X1- key * New S2 3= 3-0*1 1= 1-0*0 0= 0-0*0 0= 0-0*0 0= 0-0*(1) 1 = 1-0*(-1) 0= 0-0*(-2)
  • 40. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.40 Example 2- Gromory cutting plane Method S2 is leaving from the system and S4 is entering into the system. New S2 =( 1, 0, 0, 0, 1,-1 -2) New S1 = old S1- key * New S2 11= 17/2-(-5/2)*1 0= 0-(-5/2) *0 0= 0-(-5/2) *0 1= 1- (-5/2) *0 0= -5/2- (-5/2) *(1) 3 = 11/2-(-5/2) *(-1) -5= 0-(-5/2) *(-2)
  • 41. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.41 Example 2- Gromory cutting plane Method 2 1 0 0 0 0 C Pmix Quan X1 X2 S1 S2 S3 S4 1 X2 0 0 1 0 0 -1/2 1 2 X1 3 1 0 0 0 1 0 0 S1 11 0 0 1 0 3 -5 0 S2 1 0 0 0 1 -1 -2 Z 6 2 1 0 0 3/2 1 C-Z 0 -2 0 0 -3/2 -1
  • 42. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.42 Example 2- Gromory cutting plane Method Now, we know that the optimal solution has been reached. It manufactures 3 mugs and 0 bowl and this uses all the hours and materials available except for 11 hours of labor as well as 1 lb of clay since S1 and S2 have the value 11 and 1 in the final solution row. The profit earned by this optimal integer solution is $ 6 which is only slightly lower than $20/3 ($ 6.66) profit earned by the optimal noninteger solution in the first Table:
  • 43. Ch 5: Integer programmimg Operations Research © 2010/11, Sami Fethi, EMU, All Right Reserved.43 End of chapter