The Simplex Procedure Daniel B. Taylor AAEC 5024 Department of Agricultural and Applied Economics Virginia Tech.

Slides:



Advertisements
Similar presentations
February 14, 2002 Putting Linear Programs into standard form
Advertisements

Chapter 5: Linear Programming: The 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.
LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
Chapter 6 Linear Programming: The Simplex Method
Dr. Sana’a Wafa Al-Sayegh
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
Degeneracy and the Convergence of the Simplex Algorithm LI Xiao-lei.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Linear Inequalities and Linear Programming Chapter 5
Computational Methods for Management and Economics Carla Gomes Module 6b Simplex Pitfalls (Textbook – Hillier and Lieberman)
The Simplex Method: Standard Maximization Problems
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Operation Research Chapter 3 Simplex Method.
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Solving Linear Programs: The Simplex Method
Linear Programming (LP)
The Simplex Method.
5.6 Maximization and Minimization with Mixed Problem Constraints
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
LINEAR PROGRAMMING SIMPLEX METHOD.
Learning Objectives for Section 6.2
The Simplex algorithm.
Chapter 3 Linear Programming Methods 高等作業研究 高等作業研究 ( 一 ) Chapter 3 Linear Programming Methods (II)
Chapter 6 Linear Programming: The Simplex Method
The Two-Phase Simplex Method LI Xiao-lei. Preview When a basic feasible solution is not readily available, the two-phase simplex method may be used as.
8. Linear Programming (Simplex Method) Objectives: 1.Simplex Method- Standard Maximum problem 2. (i) Greedy Rule (ii) Ratio Test (iii) Pivot Operation.
Simplex method (algebraic interpretation)
EE/Econ 458 The Simplex Method using the Tableau Method
Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
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.
The big M method LI Xiao-lei.
Solving Linear Programming Problems: The Simplex Method
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
1. 2 Computing the Adjoint matrix: 3 Assignment #3 is available. Due: Monday Nov. 5, beginning of class.
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
Part 4 Nonlinear Programming 4.5 Quadratic Programming (QP)
 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 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
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:
University of Colorado at Boulder Yicheng Wang, Phone: , Optimization Techniques for Civil and Environmental Engineering.
Simplex Method for solving LP problems with two variables.
Simplex method : Tableau Form
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
 LP graphical solution is always associated with a corner point of the solution space.  The transition from the geometric corner point solution to the.
OR  Now, we look for other basic feasible solutions which gives better objective values than the current solution. Such solutions can be examined.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
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.
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
10CS661 OPERATION RESEARCH Engineered for Tomorrow.
The Two-Phase Simplex Method
Chapter 4 Linear Programming: The Simplex Method
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Chapter 4 The Simplex Algorithm
Presentation transcript:

The Simplex Procedure Daniel B. Taylor AAEC 5024 Department of Agricultural and Applied Economics Virginia Tech

The Basic Model Max Z=3X1+5x2 stX1<=4 2X2<=12 3x1+2x2<=18

Completing the Initialization Step Add slack (Si) variables so that the constraints may be specified as equality constraints Reformulate the objective function by moving all the terms to the left hand side of the equality sign – in part to make the interpretation of the solution more straight forward

The Model to Enter in the Simplex Tableau Max Z-3X1-5x2-0S1-0S2-0S3=0 stX1+S1=4 2X2+S2=12 3X1+2X2+S3=18

The Simplex Tableau Construct the Simplex Tableau

Iter- ation RNBVRHSb i /a ij Coefficient of

Begin to Fill out the Tableau The purpose of the first two columns is to give reference numbers to refer to when discussing the tableau

Iter- ation RNBVRHSb i /a ij Coefficient of

Begin to Fill out the Tableau The purpose of the first two columns is to give reference numbers to refer to when discussing the tableau –The iteration column records the number of the iteration you are performing –Conventionally the first tableau which really is the last phase of the initialization step is labeled zero.

Iter- ation RNBVRHSb i /a ij 0 Coefficient of

Continue to Fill out the Tableau RN just stands for the row number. We label the objective function row “0”

Iter- ation RNBVRHSb i /a ij 0 0 Coefficient of

Continue to Fill out the Tableau RN just stands for the row number. We label the objective function row 0 The remaining rows contain the constraints, and in this example are labeled 1-3

Iter- ation RNBVRHSb i /a ij 0 01 Coefficient of

Iter- ation RNBVRHSb i /a ij Coefficient of

Iter- ation RNBVRHSb i /a ij Coefficient of

“Coefficients of” Area of the Table

Iter- ation RNBVRHSb i /a ij Coefficient of

“Coefficients of” Area of the Table Is where the decision making variables (Xj) and the slack variables (Si) are listed

Iter- ation RNBV X1 RHSb i /a ij Coefficient of

Iter- ation RNBV X1X2 RHSb i /a ij Coefficient of

Iter- ation RNBV X1X2S1 RHSb i /a ij Coefficient of

Iter- ation RNBV X1X2S1S2 RHSb i /a ij Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij Coefficient of

Basic Variables The column labeled BV just keeps track of the basic variables following each iteration

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij Coefficient of

Basic Variables The column labeled BV just keeps track of the basic variables following each iteration Since there is not a basic variable in the objective function, we simply label the BV row “OBJ”

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ Coefficient of

Basic Variables The column labeled BV just keeps track of the basic variables following each iteration Since there is not a basic variable in the objective function, we simply label the BV row “OBJ” In the initial tableau (0) the slack variables associated with each constraint are our basic variables

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ 01S1 2 3 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ 01S1 2S2 3 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ 01S1 2S2 3S3 Coefficient of

Right Hand Side The column labeled RHS contains the numbers on the right hand side of the equations in the linear programming problem

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ 01S1 2S2 3S3 Coefficient of

Completing the Initialization Step Coefficients are taken from each equation and entered into the appropriate row of the tableau So for the first row, the objective function

The Model to Enter in the Simplex Tableau Max Z-3X1-5x2-0S1-0S2-0S3=0 stX1+S1=4 2X2+S2=12 3X1+2X2+S3=18

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ-3 01S1 2S2 3S3 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S1 2S2 3S3 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S1 2S2 3S3 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S1 2S2 3S3 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S1 2S2 3S3 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S1 2S2 3S3 Coefficient of

Completing the Initialization Step For the second row which is the first constraint

The Model to Enter in the Simplex Tableau Max Z-3X1-5x2-0S1-0S2-0S3=0 stX1+S1=4 2X2+S2=12 3X1+2X2+S3=18

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S S2 3S3 Coefficient of

Completing the Initialization Step For the second constraint

The Model to Enter in the Simplex Tableau Max Z-3X1-5x2-0S1-0S2-0S3=0 stX1+S1=4 2X2+S2=12 3X1+2X2+S3=18

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S S S3 Coefficient of

Completing the Initialization Step For the third constraint

The Model to Enter in the Simplex Tableau Max Z-3X1-5x2-0S1-0S2-0S3=0 stX1+S1=4 2X2+S2=12 3X1+2X2+S3=18

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S S S Coefficient of

Select the Entering Basic Variable Choose the most negative objective function coefficient Why? Because with the reformulated objective function that coefficient will increase the objective function value most rapidly The column of the entering basic variable is referred to as the pivot column

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ S S S Coefficient of

Determine the Leaving Basic Variable Choose the minimum of the of the result of dividing the RHS coefficients by the coefficients in the pivot column: (b i /a ij ) for a ij >0 Why the minimum? Otherwise the solution will either be infeasible or unbounded.

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 Coefficient of

Pivot Row The row selected for the leaving basic variable is referred to as the pivot row

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 Coefficient of

Pivot Number The number at the intersection of the pivot row and pivot column is referred to as the pivot number

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 Coefficient of

Number the Next Tableau Tableau Number 1

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 1 Coefficient of

Renumber the Rows 1 2 3

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2= Coefficient of

Write Down the Remaining Basic Variables S2 has left the basis as it was the basic variable in the pivot row

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ 11S1 2 3S3 Coefficient of

Write Down the Remaining Basic Variables S2 has left the basis as it was the basic variable in the pivot row X2 enters the basis replacing S2

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ 11S1 2X2 3S3 Coefficient of

Prepare the Pivot Row to Perform Row Operations Divide the coefficients in the pivot row by the pivot number and write them down in the same row in the next tableau – tableau number 1

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ 11S1 2X20101/206 3S3 Coefficient of

Row Operations Now the idea is to use row operations to drive all of the other entries in the pivot column to zero, using the row that you just divided by 2 and moved down into tableau 1 Remind any one of Gauss-Jordan reduction?

Row Operations Now the idea is to use row operations to drive all of the other entries in the pivot column to zero, using the row that you just divided by 2 and moved down into tableau 1 Remind any one of Gauss-Jordan reduction? In case you were wondering, you use this and only this row for the row operations on the other rows. The fact that you know what row to use for the operations coupled with the entering and leaving basic variable rules is what makes the simplex solution process “easy” – well I guess we can at least say straight forward in that you always know exactly what row operations to perform.

Row Operations Now the idea is to use row operations to drive all of the other entries in the pivot column to zero, using the row that you just divided by 2 and moved down into tableau 1 Remind any one of Gauss-Jordan reduction? Since the coefficient in row 1 is already zero all you have to do is copy that row into tableau 1

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ 11S X20101/206 3S3 Coefficient of

Work On Row Three Subtract 2 times the new row two from the old row 3 in tableau 0 and write down the results in the new row 3 in tableau 1

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ 11S X20101/206 3S Coefficient of

Complete the Iteration Add 5 times the new row 2 to the old row 0 in tableau 0 and write down the results in row 0 in tableau 1 The iteration is complete because all entries in the old pivot column are now zero except for the old pivot number, which is 1

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/ S X20101/206 3S Coefficient of

Start the Next Iteration Select the entering basic variable

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/ S X20101/206 3S Coefficient of

Start the Next Iteration Select the entering basic variable X1

Start the Next Iteration Select the entering basic variable X1 Calculate (b i /a ij ) for a ij >0

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 Coefficient of

Start the Next Iteration Select the entering basic variable X1 Calculate (b i /a ij ) for a ij >0 Select the leaving basic variable

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 Coefficient of

Start the Next Iteration Select the entering basic variable X1 Calculate (b i /a ij ) for a ij >0 Select the leaving basic variable S3

Start the Next Iteration Select the entering basic variable X1 Calculate (b i /a ij ) for a ij >0 Select the leaving basic variable S3 The pivot number is 3

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 Coefficient of

Begin to Fill Out the Next Tableau Specify the iteration number (2) Write down the row numbers Specify the basic variables

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ 21S1 2X2 3X1 Coefficient of

Prepare the Pivot Row to Perform Row Operations Divide the coefficients in the pivot row by the pivot number and write them down in the same row in the next tableau – tableau number 2

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ 21S1 2X2 3X1100-1/31/32 Coefficient of

Prepare the Pivot Row to Perform Row Operations Divide the coefficients in the pivot row by the pivot number and write them down in the same row in the next tableau – tableau number 2 Since the coefficient in row 2 is already zero all you have to do is copy that row into tableau 2

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ 21S1 2X20101/206 3X1100-1/31/32 Coefficient of

Work On Row One Subtract 1 times the new row three from the old row 1 in tableau 1 and write down the results in the new row 1 in tableau 2

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ 21S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

Complete the Iteration Add 3 times the new row 3 to the old row 0 in tableau 1 and write down the results in row 0 in tableau 2 The iteration is complete because all entries in the old pivot column are now zero except for the old pivot number, which is 1

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

You are Done! You have arrived at the optimal solution to the problem (assuming no math errors). Why? Because there are no negative objective function coefficients – thus no candidates for a leaving basic variable

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

You are Done! You have arrived at the optimal solution to the problem (assuming no math errors). Why? Because there are no negative objective function coefficients – thus no candidates for a leaving basic variable And your solution is feasible – because all RHS values are positive

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

Interpretation of the Final Tableau The Objective Function Value is 36

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

Interpretation of the Final Tableau The Objective Function Value is 36 The Values of the basic variables are: –S1=2 –X2=6 –X1=2 The non-basic variables are –S2=0 –S3=0

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

Interpretation of the Final Tableau The Values of the basic variables are: –S1=2 –X2=6 –X1=2 The non-basic variables are –S2=0 –S3=0 The shadow prices are: –0 for constraint 1 –3/2 for constraint 2 –1 for constraint 3

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

The Slack Variable Matrix Remember you have essentially been using Gauss-Jordan reduction to solve the problem Among other things this matrix keeps track of the net effects (in mathematical terms) of the row operations that you have preformed

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of

Iter- ation RNBV X1X2S1S2S3 RHSb i /a ij 0OBJ NA 01S NA 2S /2=6 3S /2=9 0OBJ-3005/2030NA 11S /1=4 2X20101/206NA 3S /3=2 0OBJ0003/ S10011/3-1/32 2X20101/206 3X1100-1/31/32 Coefficient of