Submit Search
Upload
Integer Programming, Gomory
•
7 likes
•
4,222 views
AVINASH JURIANI
Follow
Integer Programming, Gomory
Read less
Read more
Engineering
Report
Share
Report
Share
1 of 43
Download now
Download to read offline
Recommended
Gomory's cutting plane method
Gomory's cutting plane method
Rajesh Piryani
Integer Linear Programming
Integer Linear Programming
SukhpalRamanand
Integer programming
Integer programming
Hakeem-Ur- Rehman
Unit.4.integer programming
Unit.4.integer programming
DagnaygebawGoshme
LINEAR PROGRAMMING
LINEAR PROGRAMMING
rashi9
Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear Programming
Salah A. Skaik - MBA-PMP®
Simplex method
Simplex method
i dont work, i make people work.
Graphical Method
Graphical Method
Sachin MK
Recommended
Gomory's cutting plane method
Gomory's cutting plane method
Rajesh Piryani
Integer Linear Programming
Integer Linear Programming
SukhpalRamanand
Integer programming
Integer programming
Hakeem-Ur- Rehman
Unit.4.integer programming
Unit.4.integer programming
DagnaygebawGoshme
LINEAR PROGRAMMING
LINEAR PROGRAMMING
rashi9
Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear Programming
Salah A. Skaik - MBA-PMP®
Simplex method
Simplex method
i dont work, i make people work.
Graphical Method
Graphical Method
Sachin MK
Duality in Linear Programming
Duality in Linear Programming
jyothimonc
Linear Programming (graphical method)
Linear Programming (graphical method)
Kamel Attar
linear programming
linear programming
Karishma Chaudhary
Unit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisis
DagnaygebawGoshme
Linear programing
Linear programing
Aniruddh Tiwari
simplex method
simplex method
Karishma Chaudhary
Linear programming using the simplex method
Linear programming using the simplex method
Shivek Khurana
Dynamic Programming
Dynamic Programming
contact2kazi
Chapter 3-2
Chapter 3-2
Dasrat goswami
Big-M Method Presentation
Big-M Method Presentation
Nitesh Singh Patel
Minimization model by simplex method
Minimization model by simplex method
San Antonio de Padua - Center for Alternative Mathematics
5. advance topics in lp
5. advance topics in lp
Hakeem-Ur- Rehman
Modi method
Modi method
manpreetgrewal
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima Pandit
Purnima Pandit
Goal Programming
Goal Programming
Nico Penaredondo
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Muhammed Jiyad
Game theory
Game theory
Abu Bashar
Simplex Algorithm
Simplex Algorithm
Aizaz Ahmad
OR (JNTUK) III Mech Unit 8 simulation
OR (JNTUK) III Mech Unit 8 simulation
Nageswara Rao Thots
Unit 7 dynamic programming
Unit 7 dynamic programming
Nageswara Rao Thots
Chapter 6-INTEGER PROGRAMMING note.pdf
Chapter 6-INTEGER PROGRAMMING note.pdf
Tsegay Berhe
Or ch2 (2)
Or ch2 (2)
Fuad Mustefa
More Related Content
What's hot
Duality in Linear Programming
Duality in Linear Programming
jyothimonc
Linear Programming (graphical method)
Linear Programming (graphical method)
Kamel Attar
linear programming
linear programming
Karishma Chaudhary
Unit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisis
DagnaygebawGoshme
Linear programing
Linear programing
Aniruddh Tiwari
simplex method
simplex method
Karishma Chaudhary
Linear programming using the simplex method
Linear programming using the simplex method
Shivek Khurana
Dynamic Programming
Dynamic Programming
contact2kazi
Chapter 3-2
Chapter 3-2
Dasrat goswami
Big-M Method Presentation
Big-M Method Presentation
Nitesh Singh Patel
Minimization model by simplex method
Minimization model by simplex method
San Antonio de Padua - Center for Alternative Mathematics
5. advance topics in lp
5. advance topics in lp
Hakeem-Ur- Rehman
Modi method
Modi method
manpreetgrewal
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima Pandit
Purnima Pandit
Goal Programming
Goal Programming
Nico Penaredondo
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Muhammed Jiyad
Game theory
Game theory
Abu Bashar
Simplex Algorithm
Simplex Algorithm
Aizaz Ahmad
OR (JNTUK) III Mech Unit 8 simulation
OR (JNTUK) III Mech Unit 8 simulation
Nageswara Rao Thots
Unit 7 dynamic programming
Unit 7 dynamic programming
Nageswara Rao Thots
What's hot
(20)
Duality in Linear Programming
Duality in Linear Programming
Linear Programming (graphical method)
Linear Programming (graphical method)
linear programming
linear programming
Unit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisis
Linear programing
Linear programing
simplex method
simplex method
Linear programming using the simplex method
Linear programming using the simplex method
Dynamic Programming
Dynamic Programming
Chapter 3-2
Chapter 3-2
Big-M Method Presentation
Big-M Method Presentation
Minimization model by simplex method
Minimization model by simplex method
5. advance topics in lp
5. advance topics in lp
Modi method
Modi method
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima Pandit
Goal Programming
Goal Programming
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Game theory
Game theory
Simplex Algorithm
Simplex Algorithm
OR (JNTUK) III Mech Unit 8 simulation
OR (JNTUK) III Mech Unit 8 simulation
Unit 7 dynamic programming
Unit 7 dynamic programming
Similar to Integer Programming, Gomory
Chapter 6-INTEGER PROGRAMMING note.pdf
Chapter 6-INTEGER PROGRAMMING note.pdf
Tsegay Berhe
Or ch2 (2)
Or ch2 (2)
Fuad Mustefa
1 arithmetic
1 arithmetic
fyjordan9
Lecture - Linear Programming.pdf
Lecture - Linear Programming.pdf
lucky141651
Mathematical optimization and python
Mathematical optimization and python
Open-IT
New very very interesting Ppt best notesnew.pdf
New very very interesting Ppt best notesnew.pdf
MUKESHKUMAR601613
IE-301_OptionalProject_Group2_Report
IE-301_OptionalProject_Group2_Report
Sarp Uzel
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
ijfcstjournal
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
ijfcstjournal
REvit training
REvit training
srinivasanvenkat10
Ch3(1).pptxbbbbbbbbbbbbbbbbbbbhhhhhhhhhh
Ch3(1).pptxbbbbbbbbbbbbbbbbbbbhhhhhhhhhh
danielgetachew0922
Ees 300
Ees 300
AgwonaMAllan
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 dipankar
Dipankar Nalui
sheet6.pdf
sheet6.pdf
aminasouyah
doc6.pdf
doc6.pdf
aminasouyah
paper6.pdf
paper6.pdf
aminasouyah
lecture5.pdf
lecture5.pdf
aminasouyah
Quantum Business in Japanese Market
Quantum Business in Japanese Market
Yuichiro MInato
Optimizing profit with linear programming model
Optimizing profit with linear programming model
Amit Deshmukh
Similar to Integer Programming, Gomory
(20)
Chapter 6-INTEGER PROGRAMMING note.pdf
Chapter 6-INTEGER PROGRAMMING note.pdf
Or ch2 (2)
Or ch2 (2)
1 arithmetic
1 arithmetic
Lecture - Linear Programming.pdf
Lecture - Linear Programming.pdf
Mathematical optimization and python
Mathematical optimization and python
New very very interesting Ppt best notesnew.pdf
New very very interesting Ppt best notesnew.pdf
IE-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 PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
REvit training
REvit training
Ch3(1).pptxbbbbbbbbbbbbbbbbbbbhhhhhhhhhh
Ch3(1).pptxbbbbbbbbbbbbbbbbbbbhhhhhhhhhh
Ees 300
Ees 300
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)
Introduction to code optimization by dipankar
Introduction to code optimization by dipankar
sheet6.pdf
sheet6.pdf
doc6.pdf
doc6.pdf
paper6.pdf
paper6.pdf
lecture5.pdf
lecture5.pdf
Quantum Business in Japanese Market
Quantum Business in Japanese Market
Optimizing profit with linear programming model
Optimizing profit with linear programming model
More from AVINASH JURIANI
Matlab Master Class-Day 28.Learn (1).pptx
Matlab Master Class-Day 28.Learn (1).pptx
AVINASH JURIANI
Internship Training Report
Internship Training Report
AVINASH JURIANI
Transformations advanced
Transformations advanced
AVINASH JURIANI
Robotics done
Robotics done
AVINASH JURIANI
Ict in-schools-inspectorate-evaluation-studies
Ict in-schools-inspectorate-evaluation-studies
AVINASH JURIANI
IPV6 INTRODUCTION
IPV6 INTRODUCTION
AVINASH JURIANI
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 graphs
AVINASH JURIANI
Electrochemical Machining
Electrochemical Machining
AVINASH JURIANI
Hot Rolling Process
Hot Rolling Process
AVINASH JURIANI
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...
OPTIMIZATION OF MACHINING PARAMETERS WITH TOOL INSERT SELECTION FOR S355J2G3 ...
AVINASH JURIANI
Slotting machine
Slotting machine
AVINASH JURIANI
Tungsten Inert Gas Welding
Tungsten Inert Gas Welding
AVINASH JURIANI
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...
AVINASH JURIANI
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).pptx
Internship Training Report
Internship Training Report
Transformations advanced
Transformations advanced
Robotics done
Robotics done
Ict in-schools-inspectorate-evaluation-studies
Ict in-schools-inspectorate-evaluation-studies
IPV6 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...
casting sand, properties graphs
casting sand, properties graphs
Electrochemical Machining
Electrochemical Machining
Hot 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 ...
Slotting machine
Slotting machine
Tungsten 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...
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...
Recently uploaded
young call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Service
young call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Service
9953056974 Low Rate Call Girls In Saket, Delhi NCR
Concrete Mix Design - IS 10262-2019 - .pptx
Concrete Mix Design - IS 10262-2019 - .pptx
KartikeyaDwivedi3
computer application and construction management
computer application and construction management
MariconPadriquez1
Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024
hassan khalil
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfid
NikhilNagaraju
Comparative Analysis of Text Summarization Techniques
Comparative Analysis of Text Summarization Techniques
ugginaramesh
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdf
ROCENODodongVILLACER
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
9953056974 Low Rate Call Girls In Saket, Delhi NCR
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
Asst.prof M.Gokilavani
Past, Present and Future of Generative AI
Past, Present and Future of Generative AI
abhishek36461
What are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptx
wendy cai
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
Asst.prof M.Gokilavani
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECH
C Sai Kiran
Artificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptx
britheesh05
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Anamika Sarkar
Exploring_Network_Security_with_JA3_by_Rakesh Seal.pptx
Exploring_Network_Security_with_JA3_by_Rakesh Seal.pptx
null - The Open Security Community
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
ssuser2ae721
Correctly Loading Incremental Data at Scale
Correctly Loading Incremental Data at Scale
Alluxio, Inc.
Arduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.ppt
SAURABHKUMAR892774
Electronically Controlled suspensions system .pdf
Electronically Controlled suspensions system .pdf
me23b1001
Recently uploaded
(20)
young call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Service
young call girls in Rajiv Chowk🔝 9953056974 🔝 Delhi escort Service
Concrete Mix Design - IS 10262-2019 - .pptx
Concrete Mix Design - IS 10262-2019 - .pptx
computer application and construction management
computer application and construction management
Architect Hassan Khalil Portfolio for 2024
Architect Hassan Khalil Portfolio for 2024
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfid
Comparative Analysis of Text Summarization Techniques
Comparative Analysis of Text Summarization Techniques
Risk Assessment For Installation of Drainage Pipes.pdf
Risk Assessment For Installation of Drainage Pipes.pdf
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
Call Us -/9953056974- Call Girls In Vikaspuri-/- Delhi NCR
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
CCS355 Neural Networks & Deep Learning Unit 1 PDF notes with Question bank .pdf
Past, Present and Future of Generative AI
Past, Present and Future of Generative AI
What are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptx
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
CCS355 Neural Network & Deep Learning UNIT III notes and Question bank .pdf
Introduction to Machine Learning Unit-3 for II MECH
Introduction to Machine Learning Unit-3 for II MECH
Artificial-Intelligence-in-Electronics (K).pptx
Artificial-Intelligence-in-Electronics (K).pptx
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Study on Air-Water & Water-Water Heat Exchange in a Finned Tube Exchanger
Exploring_Network_Security_with_JA3_by_Rakesh Seal.pptx
Exploring_Network_Security_with_JA3_by_Rakesh Seal.pptx
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
Why does (not) Kafka need fsync: Eliminating tail latency spikes caused by fsync
Correctly Loading Incremental Data at Scale
Correctly Loading Incremental Data at Scale
Arduino_CSE ece ppt for working and principal of arduino.ppt
Arduino_CSE ece ppt for working and principal of arduino.ppt
Electronically Controlled suspensions system .pdf
Electronically Controlled suspensions system .pdf
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
Download now