Simplex Method for solving LP problems with two variables.

Slides:



Advertisements
Similar presentations
Chapter 5: Linear Programming: The Simplex Method
Advertisements

Lecture 3 Linear Programming: Tutorial Simplex Method
Operation Research Chapter 3 Simplex Method.
SIMPLEX METHOD FOR LP LP Model.
Assignment (6) Simplex Method for solving LP problems with two variables.
Chapter 6 Linear Programming: The Simplex Method
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Dr. Sana’a Wafa Al-Sayegh
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 9 Linear.
Sections 4.1 and 4.2 The Simplex Method: Solving Maximization and Minimization Problems.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Linear Inequalities and Linear Programming Chapter 5
The Simplex Method: Standard Maximization Problems
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Operation Research Chapter 3 Simplex Method.
Linear Programming (LP)
The Simplex Method.
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
LINEAR PROGRAMMING SIMPLEX METHOD.
Learning Objectives for Section 6.2
8. Linear Programming (Simplex Method) Objectives: 1.Simplex Method- Standard Maximum problem 2. (i) Greedy Rule (ii) Ratio Test (iii) Pivot Operation.
Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to two  constraints.
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: The Simplex Method Chapter 5.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
The Simplex Method Updated 15 February Main Steps of the Simplex Method 1.Put the problem in Row-Zero Form. 2.Construct the Simplex tableau. 3.Obtain.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Public Policy Modeling Simplex Method Tuesday, October 13, 2015 Hun Myoung Park, Ph.D. Public Management & Policy Analysis Program Graduate School of International.
Simplex Method Adapting to Other Forms.  Until now, we have dealt with the standard form of the Simplex method  What if the model has a non-standard.
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
Linear Programming – Simplex Method
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Mechanical Engineering Department 1 سورة النحل (78)
To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-1 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Quantitative Analysis.
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
Chapter 4 The Simplex Algorithm( 單體法 ) and Goal Programming Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc.
THE SIMPLEX ALGORITHM Step 1 The objective row is scanned and the column containing the most negative term is selected (pivotal column) - indicate with.
MA3264 Mathematical Modelling Lecture 9 Chapter 7 Discrete Optimization Modelling Continued.
Sensitivity analysis LI Xiao-lei. A graphical introduction to sensitivity analysis Sensitivity analysis is concerned with how changes in an LP’s parameters.
Gomory Cuts Updated 25 March Example ILP Example taken from “Operations Research: An Introduction” by Hamdy A. Taha (8 th Edition)“Operations Research:
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ 5.5 Dual problem: minimization.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Chapter 4 The Simplex Algorithm and Goal Programming
The Simplex Method. and Maximize Subject to From a geometric viewpoint : CPF solutions (Corner-Point Feasible) : Corner-point infeasible solutions 0.
Solving Linear Program by Simplex Method The Concept
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Linear programming Simplex method.
SOLVING LINEAR PROGRAMMING PROBLEMS: The Simplex Method
Chapter 4 Linear Programming: The Simplex Method
ISS500E-Quantitiative Decision Tehniques
Duality Theory and Sensitivity Analysis
Linear Programming SIMPLEX METHOD.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Linear programming Simplex method.
Chapter 4 The Simplex Algorithm
Simplex Tableau Method
Presentation transcript:

Simplex Method for solving LP problems with two variables

1- Introduction  Graphical method presented in last chapter is fine for 2 variables. But most LP problems are too complex for simple graphical procedures.  The Simplex Method: ois appropriate for problems with more than 2 variables; ouses algebra rules, to find optimal solutions; ois an algorithm and is a series of steps that will accomplish a certain task.  In this chapter will introduce the simplex method for problems with 2 variables.

2- Simplex algorithm through an example: Assume one company producing flair furniture: Tables (T) and Chairs (C). The following table provides the information available: Department ProductionAvailable Working Hours TablesChairs Carpentry43240 Painting & varnishing Profit7SR5SR

Formulation: Decision variables: T = Number of tables C = Number of chairs Objective function: Maximize Z = 7T + 5C Constraints: 2T + 1C  100 (Painting & varnishing) 4T + 3C  240 (Carpentry) T, C  0 (non-negativity constraints)

Graphical method solution Number of Chairs T C Number of Tables Feasible Region  4T + 3C  2T + 1C   Optimal Solution: T=30, C=40 Z= 410 SR

1 st Step: 1 st Step: Built initial Simplex tableau  Less-than-or-equal-to constraints (≤) are converted to equations by adding a variable called “slack variable”. oSlack variables represent unused resources.  For the flair furniture problem, define the slacks as: oS 1 = unused hours in the painting department oS 2 = unused hours in the carpentry department  The constraints are now written as: o2T + 1C + S 1 = 100 o4T + 3C + S 2 = 240

 Slack variables not appearing in an equation are added with a coefficient of 0.This allows all the variables to be monitored at all times.  The final Simplex equations appear as: o2T + 1C + 1S 1 + 0S 2 = 100 o4T + 3C + 0S 1 + 1S 2 = 240 oT, C, S 1, S 2  0  The slacks are added to the objective coefficient with 0 profit coefficients. The objective function, then, is: Max. Z= 7T + 5C + 0S 1 + 0S 2 1 st Step, continued

Initial Simplex tableau TCS1S2Quantity (Q) S S Z75000 We start by a basic solution Z=0. Non-Basic variables Basic variables

2 nd Step: 2 nd Step: Entering variable Choose one entering variable from non-basic variables (T or C) for which we have the largest positive coefficient in the objective function. Here the entering variable will be T and the corresponding column is called pivot column. TCS1S2Quantity (Q) S S Z75000 Pivot column

3 rd Step: 3 rd Step: Leaving variable Choose one leaving variable from the basic variables (S1 or S2) for which we have the smallest value of quantities (Q) divided by items of pivot column: for S1 we have 100/2=50 for S2 we have 240/4=60 Then the leaving variable will be S1 and the corresponding row is called pivot row.

3 rd Step: 3 rd Step: Leaving variable TCS1S2(Q) S S Z Pivot column Pivot row Pivot item

4 th Step: 4 th Step: Pivoting The pivoting is the changing of simplex tableau values as follow:  The entering variable (T) takes the place of leaving variable (S1).  All items of pivot column are =0 except pivot item =1.  All items of pivot row are divided by pivot item.  Other items of the tableau are calculated as follow: AB CD Pivot column Pivot row New A = A – B*C/D

4 th Step: 4 th Step: Pivoting The New value of the objective function is calculated as follow: Capacity of pivot row Z’ = Z + Largest coefficient * Pivot item If all coefficients of objective function are negatives or equal to zero the optimal solution is found. Otherwise go to step2.

4 th Step: 4 th Step: Pivoting TCS1S2Q S S Z Pivot column Pivot row Pivot item Pivoting

4 th Step: 4 th Step: Pivoting All coefficients of objective function aren’t negatives or equal to zero, the optimal solution is not found. Then go to step2. TCS1S2Q T11/ S Z03/2-7/20 350

2 nd Step: 2 nd Step: Entering variable The new largest positive coefficient in the objective function is 3/2 then the entering variable will be C. 3 rd Step: 3 rd Step: Leaving variable The new smallest value of quantities (Q) divided by items of pivot column is 40/1=40 then the leaving variable will be S2.

4 th Step: 4 th Step: Pivoting TCS1S2Q T11/ S Z03/2-7/ Pivot column Pivot row Pivot item

4 th Step: 4 th Step: Pivoting TCS1S2Q T103/2-1/2 30 C Z00-1/2-3/2 410 All coefficients of objective function are now equal to zero. then the optimal solution is found: T=30, C=40 ; Z=410

Using Simplex method, solve the LP problems modeled in chapter1. 3- Applications

The mathematical model of problem is: Max Z= 3x 1 + 5x 2 S.t. x 1  4 (Plant 1 constraint) 2x 2  12 (Plant 2 constraint) 3x 1 +2x 2  18 (Plant 3 constraint) x 1, x 2  Solving of problem1

1 st Step: 1 st Step: Initial Simplex tableau We start by a basic solution Z=0. Non-Basic variables Basic variables X1X2 S1S2S3Quantity (Q) S S S Z350000

2 nd Step: 2 nd Step: Entering variable The largest positive coefficient in the objective function is 5 then the entering variable will be X2. 3 rd Step: 3 rd Step: Leaving variable The smallest value of quantities (Q) divided by items of pivot column is 12/2=6 then the leaving variable will be S2.

4 th Step: 4 th Step: Pivoting Pivot column Pivot row Pivot item X1X2 S1S2S3 (Q) S S S Z350000

4 th Step: 4 th Step: Pivoting X1X2 S1S2S3 (Q) S X2 0101/206 S Z300-5/2030 All coefficients of objective function aren’t negatives or equal to zero, the optimal solution is not found. Then go to step2.

2 nd Step: 2 nd Step: Entering variable The new largest positive coefficient in the objective function is 3 then the entering variable will be X1. 3 rd Step: 3 rd Step: Leaving variable The smallest value of quantities (Q) divided by items of pivot column is 6/3=2 then the leaving variable will be S3.

4 th Step: 4 th Step: Pivoting Pivot column Pivot row Pivot item X1X2 S1S2S3 (Q) S X2 0101/206 S Z300-5/2030

4 th Step: 4 th Step: Pivoting All coefficients of objective function are now equal to zero. then the optimal solution is found. X1=2, X2=6, Z=36. X1X2 S1S2S3 (Q) S1 0011/3-1/32 X2 0101/206 X /31/32 Z0007/236

The mathematical model of problem is: Max Z= 10x x 2 S.t. 2x1 + 4x2  100 ( aluminum constraint) 3x1 + 2x2  80 ( steel constraint) x1, x2  Solving of problem2

1 st Step: 1 st Step: Initial Simplex tableau X1X2S1S2Quantity (Q) S S Z We start by a basic solution Z=0. Non-Basic variables Basic variables

2 nd Step: 2 nd Step: Entering variable The largest positive coefficient in the objective function is 15 then the entering variable will be X2. 3 rd Step: 3 rd Step: Leaving variable The smallest value of quantities (Q) divided by items of pivot column is 100/4=25 then the leaving variable will be S1.

4 th Step: 4 th Step: Pivoting Pivot column Pivot row Pivot item X1X2S1S2Q S S Z

4 th Step: 4 th Step: Pivoting X1X2S1S2Q X21/211/4025 S220-1/2130 Z5/2015/40375 All coefficients of objective function aren’t negatives or equal to zero, the optimal solution is not found. Then go to step2.

2 nd Step: 2 nd Step: Entering variable The new largest positive coefficient in the objective function is 5/2 then the entering variable will be X1. 3 rd Step: 3 rd Step: Leaving variable The smallest value of quantities (Q) divided by items of pivot column is 30/2=15 then the leaving variable will be S2.

4 th Step: 4 th Step: Pivoting Pivot column Pivot row Pivot item X1X2S1S2Q X21/211/4025 S220-1/2130 Z5/2015/40375

4 th Step: 4 th Step: Pivoting All coefficients of objective function are now equal to zero, the optimal solution is found: X1=15, X2=17.5, Z= X1X2S1S2Q X2013/8-1/417.5 X110-1/41/215 Z0030/8-5/4412.5