SlideShare uma empresa Scribd logo
1 de 34
Simplex Method By  Dr. Eng. / Tamer Atteya Tanta Univ. – EGYPT Facebook link
Example  Max. Z = 13x 1 +11x 2 Subject to constraints: 4x 1 +5x 2  <  1500 5x 1 +3x 2  <  1575 x 1 +2x 2  <  420 x 1 , x 2  >  0 دالة الهدف القيود أو الشروط
Rewrite objective function so it is equal to zero We then need to rewrite  Z = 13x 1 +11x 2  as: Z -13x 1 -11x 2   =0
Convert all the inequality constraints  into equalities by the use of slack variables S 1 , S 2  , S 3 . 4x 1 +5x 2  + S 1  =  1500 5x 1 +3x 2  +S 2 = 1575 x 1 +2x 2  +S 3  = 420 x 1 , x 2 , S 1 , S 2 , S 3  >  0
Z - 13x 1  -11x 2  = 0 Subject to constraints: 4x 1 +5x 2  + S 1  =  1500 5x 1 +3x 2  +S 2  = 1575 x 1 +2x 2  +S 3  = 420 Next, these equations are placed in a tableau Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z S 1 S 2 S 3 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 S 2 0 5 3 0 1 0 1575 S 3 0 1 2 0 0 1 420
a) Choose the most negative number from Z-row. That variable ( x 1  ) is the  entering variable . b) Calculate Ratio = (value-col.) / (entering   -col.) c) Choose minimum +ve Ratio. That variable (S 2 ) is the  departing  variable . Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 S 2 0 5 3 0 1 0 1575 S 3 0 1 2 0 0 1 420
a) Choose the most negative number from Z-row. That variable ( x 1  ) is the  entering variable . b) Calculate Ratio = (value-col.) / (entering   -col.) c) Choose minimum +ve Ratio. That variable (S 2 ) is the  departing  variable . Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 1500/4=375 S 2 0 5 3 0 1 0 1575 1575/5=315 S 3 0 1 2 0 0 1 420 420/1=420
Make the pivot element equal to 1 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 5 3 0 1 0 1575 S 3 0 1 2 0 0 1 420
Make the pivot element equal to 1 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 5/5 3/5 0 1/5 0 1575 / 5 S 3 0 1 2 0 0 1 420
Make the pivot element equal to 1 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 1 3/5 0 1/5 0 315 S 3 0 1 2 0 0 1 420
Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 1 3/5 0 1/5 0 315 S 3 0 1 2 0 0 1 420
Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 1 3/5 0 1/5 0 315 S 3 0 -0 1 -1 2 -3/5 0 -0 0 -1/5 1 -0 420 -315
Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 -4(0) 4 -4(1) 5 -4(3/5) 1 -4(0) 0 -4(1/5) 0 -4(0) 1500 -4(315) x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 0 13/5 1 -4/5 0 240 x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 -16/5 0 13/5 0 4095 S 1 0 0 13/5 1 -4/5 0 240 x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 -16/5 0 13/5 0 4095 S 1 0 0 13/5 1 -4/5 0 240 x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 -16/5 0 13/5 0 4095 S 1 0 0 13/5 1 -4/5 0 240 92.3 x 1 0 1 3/5 0 1/5 0 315 525 S 3 0 0 7/5 0 -1/5 1 105 75
Optimal Solution is :  x 1 = 270, x 2 = 75, Z= 4335 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 0 0 15/7 16/7 4335 S 1 0 0 0 1 -3/7 -13/7 45 x 1 0 1 0 0 2/7 -3/7 270 x 2 0 0 1 0 -1/7 5/7 75
Example Max. Z = 3x 1 +5x 2 +4x 3 Subject to constraints: 2x 1 +3x 2  <  8 2x 2 +5x 3  <  10 3x 1 +2x 2 +4x 3  <  15 x 1 , x 2 , x 3  >  0
Cont… Let S 1 , S 2 , S 3  be the three slack variables.  Modified form is: Z - 3x 1 -5x 2 -4x 3  =0 2x 1 +3x 2  +S 1 =  8 2x 2 +5x 3  +S 2 = 10 3x 1 +2x 2 +4x 3 +S 3 = 15 x 1 , x 2 , x 3 ,   S 1 ,   S 2 ,   S 3  >  0 Initial BFS is : x 1 = 0, x 2 = 0, x 3 =0, S 1 = 8,  S 2 = 10, S 3 = 15 and Z=0.
Cont… Therefore, x 2  is the entering variable and S 1  is the departing variable. Basic Variable Coefficients of:  Sol. Ratio Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 -3 -5 -4 0 0 0 0 S 1 0 2 3 0 1 0 0 8 8/3 S 2 0 0 2 5 0 1 0 10 5 S 3 0 3 2 4 0 0 1 15 15/2
Cont… Therefore, x 3  is the entering variable and S 2  is the departing variable. Basic Variable Coefficients of:  Sol. Ratio Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 1/3 0 -4 5/3 0 0 40/3 x 2 0 2/3 1 0 1/3 0 0 8/3 - S 2 0 -4/3 0 5 -2/3 1 0 14/3 14/15 S 3 0 5/3 0 4 -2/3 0 1 29/3 29/12
Cont… Therefore, x 1  is the entering variable and S 3  is the departing variable. Basic Variable Coefficients of:  Sol. Ratio Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 -11/15 0 0 17/15 4/5 0 256/15 x 2 0 2/3 1 0 1/3 0 0 8/3 4 x 3 0 -4/15 0 1 -2/15 1/5 0 14/15 - S 3 0 41/15 0 0 2/15 -4/5 1 89/15 89/41
Cont… Optimal Solution is :  x 1 = 89/41, x 2 = 50/41, x 3 =62/41, Z= 765/41 Basic Variable Coefficients of:  Sol. Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 0 0 0 45/41 24/41 11/41 765/41 x 2 0 0 1 0 15/41 8/41 -10/41 50/41 x 3 0 0 0 1 -6/41 5/41 4/41 62/41 x 1 0 1 0 0 -2/41 -12/41 15/41 89/41
Example Min.. Z = x 1  - 3x 2  + 2x 3 Subject to constraints: 3x 1  - x 2  + 3x 3   <   7 -2x 1  + 4x 2  <  12 -4x 1  + 3x 2  + 8x 3   <  10 x 1 , x 2 , x 3  >  0
Cont… Convert the problem into maximization problem Max.. Z’ = -x 1  + 3x 2  - 2x 3  where Z’= -Z Subject to constraints: 3x 1  - x 2  + 3x 3   <   7 -2x 1  + 4x 2  <  12 -4x 1  + 3x 2  + 8x 3   <  10 x 1 , x 2 , x 3  >  0
Cont… Let S 1 , S 2  and S 3  be three slack variables. Modified form is: Z’ + x 1  - 3x 2  + 2x 3  = 0 3x 1  - x 2  + 3x 3  +S 1  =   7 -2x 1  + 4x 2  + S 2  = 12 -4x 1  + 3x 2  + 8x 3  +S 3  =  10 x 1 , x 2 , x 3  >  0 Initial BFS is : x 1 = 0, x 2 = 0, x 3 =0, S 1 = 7, S 2 = 12, S 3  = 10  and Z=0.
Cont… Therefore, x 2  is the entering variable and S 2  is the departing variable. Basic Variable Coefficients of:  Sol. Ratio Z’ x 1 x 2 x 3 S 1 S 2 S 3 Z’ 1 1 -3 2 0 0 0 0 S 1 0 3 -1 3 1 0 0 7 - S 2 0 -2 4 0 0 1 0 12 3 S 3 0 -4 3 8 0 0 1 10 10/3
Cont… Therefore, x 1  is the entering variable and S 1  is the departing variable. Basic Variable Coefficients of:  Sol. Ratio Z’ x 1 x 2 x 3 S 1 S 2 S 3 Z’ 1 -1/2 0 2 0 3/4 0 9 S 1 0 5/2 0 3 1 1/4 0 10 4 x 2 0 -1/2 1 0 0 1/4 0 3 - S 3 0 -5/2 0 8 0 -3/4 1 1 -
Cont… ,[object Object],[object Object],Basic Variable Coefficients of:  Sol. Z’ x 1 x 2 x 3 S 1 S 2 S 3 Z’ 1 0 0 13/5 1/5 8/10 0 11 x 1 0 1 0 6/5 2/5 1/10 0 4 x 2 0 0 1 3/5 1/5 3/10 0 5 S 3 0 0 0 11 1 -1/2 1 11
Example Max.. Z = 3x 1  + 4x 2 Subject to constraints: x 1  - x 2  <   1 -x 1  + x 2  <  2 x 1 , x 2  >  0
Cont… Let S 1  and S 2  be two slack variables . Modified form is: Z -3x 1  - 4x 2  = 0 x 1  - x 2  +S 1  =   1 -x 1  + x 2  +S 2  = 2 x 1 , x 2 , S 1 , S 2  >  0 Initial BFS is : x 1 = 0, x 2 = 0, S 1 = 1, S 2 = 2 and Z=0.
Cont… Therefore, x 2  is the entering variable and S 2  is the departing variable. Basic Variable Coefficients of:  Sol. Ratio Z x 1 x 2 S 1 S 2 Z 1 -3 -4 0 0 0 S 1 0 1 -1 1 0 1 - S 2 0 -1 1 0 1 2 2
Cont… x 1  is the entering variable, but as in x 1  column every no. is less than equal to zero, ratio cannot be calculated. Therefore given problem is having a  unbounded solution . Basic Variable Coefficients of:  Sol. Ratio Z x 1 x 2 S 1 S 2 Z 1 -7 0 0 4 8 S 1 0 0 0 1 1 3 - x 2 0 -1 1 0 1 2 -

Mais conteúdo relacionado

Mais procurados

Simplex method - Maximisation Case
Simplex method - Maximisation CaseSimplex method - Maximisation Case
Simplex method - Maximisation CaseJoseph Konnully
 
Procedure Of Simplex Method
Procedure Of Simplex MethodProcedure Of Simplex Method
Procedure Of Simplex Methoditsvineeth209
 
Vogel's Approximation Method & Modified Distribution Method
Vogel's Approximation Method & Modified Distribution MethodVogel's Approximation Method & Modified Distribution Method
Vogel's Approximation Method & Modified Distribution MethodKaushik Maitra
 
Unit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisisUnit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisisDagnaygebawGoshme
 
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditLinear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditPurnima Pandit
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical MethodJoseph Konnully
 
Graphical Method
Graphical MethodGraphical Method
Graphical MethodSachin MK
 
Special Cases in Simplex Method
Special Cases in Simplex MethodSpecial Cases in Simplex Method
Special Cases in Simplex MethodDivyansh Verma
 
3. linear programming senstivity analysis
3. linear programming senstivity analysis3. linear programming senstivity analysis
3. linear programming senstivity analysisHakeem-Ur- Rehman
 
Integer Linear Programming
Integer Linear ProgrammingInteger Linear Programming
Integer Linear ProgrammingSukhpalRamanand
 
Simplex method: Slack, Surplus & Artificial variable
Simplex method:  Slack, Surplus & Artificial variableSimplex method:  Slack, Surplus & Artificial variable
Simplex method: Slack, Surplus & Artificial variableDevyaneeDevyanee2007
 
Transportation problem ppt
Transportation problem pptTransportation problem ppt
Transportation problem pptDr T.Sivakami
 

Mais procurados (20)

Simplex method - Maximisation Case
Simplex method - Maximisation CaseSimplex method - Maximisation Case
Simplex method - Maximisation Case
 
Procedure Of Simplex Method
Procedure Of Simplex MethodProcedure Of Simplex Method
Procedure Of Simplex Method
 
Vogel's Approximation Method & Modified Distribution Method
Vogel's Approximation Method & Modified Distribution MethodVogel's Approximation Method & Modified Distribution Method
Vogel's Approximation Method & Modified Distribution Method
 
4-The Simplex Method.ppt
4-The Simplex Method.ppt4-The Simplex Method.ppt
4-The Simplex Method.ppt
 
Unit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisisUnit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisis
 
Linear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima PanditLinear Programming Problems : Dr. Purnima Pandit
Linear Programming Problems : Dr. Purnima Pandit
 
Big m method
Big m methodBig m method
Big m method
 
Big-M Method Presentation
Big-M Method PresentationBig-M Method Presentation
Big-M Method Presentation
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
 
Simplex algorithm
Simplex algorithmSimplex algorithm
Simplex algorithm
 
Graphical Method
Graphical MethodGraphical Method
Graphical Method
 
Duality
DualityDuality
Duality
 
Special Cases in Simplex Method
Special Cases in Simplex MethodSpecial Cases in Simplex Method
Special Cases in Simplex Method
 
3. linear programming senstivity analysis
3. linear programming senstivity analysis3. linear programming senstivity analysis
3. linear programming senstivity analysis
 
LINEAR PROGRAMMING
LINEAR PROGRAMMINGLINEAR PROGRAMMING
LINEAR PROGRAMMING
 
Integer Linear Programming
Integer Linear ProgrammingInteger Linear Programming
Integer Linear Programming
 
Simplex method: Slack, Surplus & Artificial variable
Simplex method:  Slack, Surplus & Artificial variableSimplex method:  Slack, Surplus & Artificial variable
Simplex method: Slack, Surplus & Artificial variable
 
Transportation problem ppt
Transportation problem pptTransportation problem ppt
Transportation problem ppt
 
Linear Programming
Linear ProgrammingLinear Programming
Linear Programming
 
Integer programming
Integer programmingInteger programming
Integer programming
 

Semelhante a Simplex method

simplex method-maths 4 mumbai university
simplex method-maths 4 mumbai universitysimplex method-maths 4 mumbai university
simplex method-maths 4 mumbai universityshobhakedari59
 
Linear programming
Linear programmingLinear programming
Linear programmingsabin kafle
 
Dynamic equity price pdf
Dynamic equity price pdfDynamic equity price pdf
Dynamic equity price pdfDavid Keck
 
Two Phase Method- Linear Programming
Two Phase Method- Linear ProgrammingTwo Phase Method- Linear Programming
Two Phase Method- Linear ProgrammingManas Lad
 
Simplex Method
Simplex MethodSimplex Method
Simplex Methodkzoe1996
 
OR presentation simplex.pptx
OR presentation simplex.pptxOR presentation simplex.pptx
OR presentation simplex.pptxpranalpatilPranal
 
Algeba 1. 9.1 Solving equations review
Algeba 1. 9.1 Solving equations reviewAlgeba 1. 9.1 Solving equations review
Algeba 1. 9.1 Solving equations reviewdmatkeson21
 
Algebra 1. 9.1 Solving equations review
Algebra 1.  9.1 Solving equations reviewAlgebra 1.  9.1 Solving equations review
Algebra 1. 9.1 Solving equations reviewdmatkeson21
 
OR Linear Programming
OR Linear ProgrammingOR Linear Programming
OR Linear Programmingchaitu87
 
Power divider, combiner and coupler.ppt
Power divider, combiner and coupler.pptPower divider, combiner and coupler.ppt
Power divider, combiner and coupler.pptDeqAhmed2
 
Solve given LP problem using simplex method and find maximum value o.pdf
Solve given LP problem using simplex method and find maximum value o.pdfSolve given LP problem using simplex method and find maximum value o.pdf
Solve given LP problem using simplex method and find maximum value o.pdfaminbijal86
 
Isoparametric mapping
Isoparametric mappingIsoparametric mapping
Isoparametric mappingLinh Tran
 
Duel simplex method_operations research .pptx
Duel simplex method_operations research .pptxDuel simplex method_operations research .pptx
Duel simplex method_operations research .pptxRaja Manyam
 
Normal Distribution of data (Continous data)
Normal Distribution of data (Continous data)Normal Distribution of data (Continous data)
Normal Distribution of data (Continous data)keyurgala
 

Semelhante a Simplex method (20)

simplex method-maths 4 mumbai university
simplex method-maths 4 mumbai universitysimplex method-maths 4 mumbai university
simplex method-maths 4 mumbai university
 
Simplex two phase
Simplex two phaseSimplex two phase
Simplex two phase
 
Lpp simplex method
Lpp simplex methodLpp simplex method
Lpp simplex method
 
Linear programming
Linear programmingLinear programming
Linear programming
 
Dynamic equity price pdf
Dynamic equity price pdfDynamic equity price pdf
Dynamic equity price pdf
 
Two Phase Method- Linear Programming
Two Phase Method- Linear ProgrammingTwo Phase Method- Linear Programming
Two Phase Method- Linear Programming
 
Simplex Method
Simplex MethodSimplex Method
Simplex Method
 
OR presentation simplex.pptx
OR presentation simplex.pptxOR presentation simplex.pptx
OR presentation simplex.pptx
 
Algeba 1. 9.1 Solving equations review
Algeba 1. 9.1 Solving equations reviewAlgeba 1. 9.1 Solving equations review
Algeba 1. 9.1 Solving equations review
 
Algebra 1. 9.1 Solving equations review
Algebra 1.  9.1 Solving equations reviewAlgebra 1.  9.1 Solving equations review
Algebra 1. 9.1 Solving equations review
 
Metode simpleks dual
Metode simpleks dualMetode simpleks dual
Metode simpleks dual
 
Simplex Method
Simplex MethodSimplex Method
Simplex Method
 
OR Linear Programming
OR Linear ProgrammingOR Linear Programming
OR Linear Programming
 
Serpent sboxes
Serpent sboxesSerpent sboxes
Serpent sboxes
 
Control system
Control systemControl system
Control system
 
Power divider, combiner and coupler.ppt
Power divider, combiner and coupler.pptPower divider, combiner and coupler.ppt
Power divider, combiner and coupler.ppt
 
Solve given LP problem using simplex method and find maximum value o.pdf
Solve given LP problem using simplex method and find maximum value o.pdfSolve given LP problem using simplex method and find maximum value o.pdf
Solve given LP problem using simplex method and find maximum value o.pdf
 
Isoparametric mapping
Isoparametric mappingIsoparametric mapping
Isoparametric mapping
 
Duel simplex method_operations research .pptx
Duel simplex method_operations research .pptxDuel simplex method_operations research .pptx
Duel simplex method_operations research .pptx
 
Normal Distribution of data (Continous data)
Normal Distribution of data (Continous data)Normal Distribution of data (Continous data)
Normal Distribution of data (Continous data)
 

Último

Single or Multiple melodic lines structure
Single or Multiple melodic lines structureSingle or Multiple melodic lines structure
Single or Multiple melodic lines structuredhanjurrannsibayan2
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxPooja Bhuva
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfPoh-Sun Goh
 
Introduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The BasicsIntroduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The BasicsTechSoup
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17Celine George
 
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning PresentationSOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentationcamerronhm
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxRamakrishna Reddy Bijjam
 
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptxMaritesTamaniVerdade
 
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfUGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfNirmal Dwivedi
 
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17Celine George
 
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning ExhibitSociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibitjbellavia9
 
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptxHMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptxmarlenawright1
 
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Pooja Bhuva
 
On National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan FellowsOn National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan FellowsMebane Rash
 
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxheathfieldcps1
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...Nguyen Thanh Tu Collection
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfagholdier
 
Food safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdfFood safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdfSherif Taha
 
How to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POSHow to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POSCeline George
 

Último (20)

Single or Multiple melodic lines structure
Single or Multiple melodic lines structureSingle or Multiple melodic lines structure
Single or Multiple melodic lines structure
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptx
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
 
Introduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The BasicsIntroduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The Basics
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17
 
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning PresentationSOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentation
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
 
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdfUGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
 
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
 
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning ExhibitSociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
 
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptxHMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
 
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
 
Spatium Project Simulation student brief
Spatium Project Simulation student briefSpatium Project Simulation student brief
Spatium Project Simulation student brief
 
On National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan FellowsOn National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan Fellows
 
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
Food safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdfFood safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdf
 
How to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POSHow to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POS
 

Simplex method

  • 1. Simplex Method By Dr. Eng. / Tamer Atteya Tanta Univ. – EGYPT Facebook link
  • 2. Example Max. Z = 13x 1 +11x 2 Subject to constraints: 4x 1 +5x 2 < 1500 5x 1 +3x 2 < 1575 x 1 +2x 2 < 420 x 1 , x 2 > 0 دالة الهدف القيود أو الشروط
  • 3. Rewrite objective function so it is equal to zero We then need to rewrite Z = 13x 1 +11x 2 as: Z -13x 1 -11x 2 =0
  • 4. Convert all the inequality constraints into equalities by the use of slack variables S 1 , S 2 , S 3 . 4x 1 +5x 2 + S 1 = 1500 5x 1 +3x 2 +S 2 = 1575 x 1 +2x 2 +S 3 = 420 x 1 , x 2 , S 1 , S 2 , S 3 > 0
  • 5. Z - 13x 1 -11x 2 = 0 Subject to constraints: 4x 1 +5x 2 + S 1 = 1500 5x 1 +3x 2 +S 2 = 1575 x 1 +2x 2 +S 3 = 420 Next, these equations are placed in a tableau Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z S 1 S 2 S 3 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 S 2 0 5 3 0 1 0 1575 S 3 0 1 2 0 0 1 420
  • 6. a) Choose the most negative number from Z-row. That variable ( x 1 ) is the entering variable . b) Calculate Ratio = (value-col.) / (entering -col.) c) Choose minimum +ve Ratio. That variable (S 2 ) is the departing variable . Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 S 2 0 5 3 0 1 0 1575 S 3 0 1 2 0 0 1 420
  • 7. a) Choose the most negative number from Z-row. That variable ( x 1 ) is the entering variable . b) Calculate Ratio = (value-col.) / (entering -col.) c) Choose minimum +ve Ratio. That variable (S 2 ) is the departing variable . Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 1500/4=375 S 2 0 5 3 0 1 0 1575 1575/5=315 S 3 0 1 2 0 0 1 420 420/1=420
  • 8. Make the pivot element equal to 1 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 5 3 0 1 0 1575 S 3 0 1 2 0 0 1 420
  • 9. Make the pivot element equal to 1 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 5/5 3/5 0 1/5 0 1575 / 5 S 3 0 1 2 0 0 1 420
  • 10. Make the pivot element equal to 1 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 1 3/5 0 1/5 0 315 S 3 0 1 2 0 0 1 420
  • 11. Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 1 3/5 0 1/5 0 315 S 3 0 1 2 0 0 1 420
  • 12. Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 4 5 1 0 0 1500 x 1 0 1 3/5 0 1/5 0 315 S 3 0 -0 1 -1 2 -3/5 0 -0 0 -1/5 1 -0 420 -315
  • 13. Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 -4(0) 4 -4(1) 5 -4(3/5) 1 -4(0) 0 -4(1/5) 0 -4(0) 1500 -4(315) x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
  • 14. Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 -13 -11 0 0 0 0 S 1 0 0 13/5 1 -4/5 0 240 x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
  • 15. Make the pivot column values into zeros Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 -16/5 0 13/5 0 4095 S 1 0 0 13/5 1 -4/5 0 240 x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
  • 16. Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 -16/5 0 13/5 0 4095 S 1 0 0 13/5 1 -4/5 0 240 x 1 0 1 3/5 0 1/5 0 315 S 3 0 0 7/5 0 -1/5 1 105
  • 17. Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 -16/5 0 13/5 0 4095 S 1 0 0 13/5 1 -4/5 0 240 92.3 x 1 0 1 3/5 0 1/5 0 315 525 S 3 0 0 7/5 0 -1/5 1 105 75
  • 18. Optimal Solution is : x 1 = 270, x 2 = 75, Z= 4335 Z x 1 x 2 S 1 S 2 S 3 Value Ratio Z 1 0 0 0 15/7 16/7 4335 S 1 0 0 0 1 -3/7 -13/7 45 x 1 0 1 0 0 2/7 -3/7 270 x 2 0 0 1 0 -1/7 5/7 75
  • 19. Example Max. Z = 3x 1 +5x 2 +4x 3 Subject to constraints: 2x 1 +3x 2 < 8 2x 2 +5x 3 < 10 3x 1 +2x 2 +4x 3 < 15 x 1 , x 2 , x 3 > 0
  • 20. Cont… Let S 1 , S 2 , S 3 be the three slack variables. Modified form is: Z - 3x 1 -5x 2 -4x 3 =0 2x 1 +3x 2 +S 1 = 8 2x 2 +5x 3 +S 2 = 10 3x 1 +2x 2 +4x 3 +S 3 = 15 x 1 , x 2 , x 3 , S 1 , S 2 , S 3 > 0 Initial BFS is : x 1 = 0, x 2 = 0, x 3 =0, S 1 = 8, S 2 = 10, S 3 = 15 and Z=0.
  • 21. Cont… Therefore, x 2 is the entering variable and S 1 is the departing variable. Basic Variable Coefficients of: Sol. Ratio Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 -3 -5 -4 0 0 0 0 S 1 0 2 3 0 1 0 0 8 8/3 S 2 0 0 2 5 0 1 0 10 5 S 3 0 3 2 4 0 0 1 15 15/2
  • 22. Cont… Therefore, x 3 is the entering variable and S 2 is the departing variable. Basic Variable Coefficients of: Sol. Ratio Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 1/3 0 -4 5/3 0 0 40/3 x 2 0 2/3 1 0 1/3 0 0 8/3 - S 2 0 -4/3 0 5 -2/3 1 0 14/3 14/15 S 3 0 5/3 0 4 -2/3 0 1 29/3 29/12
  • 23. Cont… Therefore, x 1 is the entering variable and S 3 is the departing variable. Basic Variable Coefficients of: Sol. Ratio Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 -11/15 0 0 17/15 4/5 0 256/15 x 2 0 2/3 1 0 1/3 0 0 8/3 4 x 3 0 -4/15 0 1 -2/15 1/5 0 14/15 - S 3 0 41/15 0 0 2/15 -4/5 1 89/15 89/41
  • 24. Cont… Optimal Solution is : x 1 = 89/41, x 2 = 50/41, x 3 =62/41, Z= 765/41 Basic Variable Coefficients of: Sol. Z x 1 x 2 x 3 S 1 S 2 S 3 Z 1 0 0 0 45/41 24/41 11/41 765/41 x 2 0 0 1 0 15/41 8/41 -10/41 50/41 x 3 0 0 0 1 -6/41 5/41 4/41 62/41 x 1 0 1 0 0 -2/41 -12/41 15/41 89/41
  • 25. Example Min.. Z = x 1 - 3x 2 + 2x 3 Subject to constraints: 3x 1 - x 2 + 3x 3 < 7 -2x 1 + 4x 2 < 12 -4x 1 + 3x 2 + 8x 3 < 10 x 1 , x 2 , x 3 > 0
  • 26. Cont… Convert the problem into maximization problem Max.. Z’ = -x 1 + 3x 2 - 2x 3 where Z’= -Z Subject to constraints: 3x 1 - x 2 + 3x 3 < 7 -2x 1 + 4x 2 < 12 -4x 1 + 3x 2 + 8x 3 < 10 x 1 , x 2 , x 3 > 0
  • 27. Cont… Let S 1 , S 2 and S 3 be three slack variables. Modified form is: Z’ + x 1 - 3x 2 + 2x 3 = 0 3x 1 - x 2 + 3x 3 +S 1 = 7 -2x 1 + 4x 2 + S 2 = 12 -4x 1 + 3x 2 + 8x 3 +S 3 = 10 x 1 , x 2 , x 3 > 0 Initial BFS is : x 1 = 0, x 2 = 0, x 3 =0, S 1 = 7, S 2 = 12, S 3 = 10 and Z=0.
  • 28. Cont… Therefore, x 2 is the entering variable and S 2 is the departing variable. Basic Variable Coefficients of: Sol. Ratio Z’ x 1 x 2 x 3 S 1 S 2 S 3 Z’ 1 1 -3 2 0 0 0 0 S 1 0 3 -1 3 1 0 0 7 - S 2 0 -2 4 0 0 1 0 12 3 S 3 0 -4 3 8 0 0 1 10 10/3
  • 29. Cont… Therefore, x 1 is the entering variable and S 1 is the departing variable. Basic Variable Coefficients of: Sol. Ratio Z’ x 1 x 2 x 3 S 1 S 2 S 3 Z’ 1 -1/2 0 2 0 3/4 0 9 S 1 0 5/2 0 3 1 1/4 0 10 4 x 2 0 -1/2 1 0 0 1/4 0 3 - S 3 0 -5/2 0 8 0 -3/4 1 1 -
  • 30.
  • 31. Example Max.. Z = 3x 1 + 4x 2 Subject to constraints: x 1 - x 2 < 1 -x 1 + x 2 < 2 x 1 , x 2 > 0
  • 32. Cont… Let S 1 and S 2 be two slack variables . Modified form is: Z -3x 1 - 4x 2 = 0 x 1 - x 2 +S 1 = 1 -x 1 + x 2 +S 2 = 2 x 1 , x 2 , S 1 , S 2 > 0 Initial BFS is : x 1 = 0, x 2 = 0, S 1 = 1, S 2 = 2 and Z=0.
  • 33. Cont… Therefore, x 2 is the entering variable and S 2 is the departing variable. Basic Variable Coefficients of: Sol. Ratio Z x 1 x 2 S 1 S 2 Z 1 -3 -4 0 0 0 S 1 0 1 -1 1 0 1 - S 2 0 -1 1 0 1 2 2
  • 34. Cont… x 1 is the entering variable, but as in x 1 column every no. is less than equal to zero, ratio cannot be calculated. Therefore given problem is having a unbounded solution . Basic Variable Coefficients of: Sol. Ratio Z x 1 x 2 S 1 S 2 Z 1 -7 0 0 4 8 S 1 0 0 0 1 1 3 - x 2 0 -1 1 0 1 2 -