Using Spreadsheets for Linear Programming with The Simplex Method A sample problem By: Jeffrey Bivin Lake Zurich High School Last Updated: October 11,

Slides:



Advertisements
Similar presentations
By: Jeffrey Bivin Lake Zurich High School Last Updated: October 11, 2005.
Advertisements

Solving Quadratics by Completing the Square & Quadratic Formula
Standard Minimization Problems with the Dual
Simplex Method Example 4.2 # 17 Produced by E. Gretchen Gascon.
Operation Research Chapter 3 Simplex Method.
Nonstandard Problmes Produced by E. Gretchen Gascon.
© Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Pivoting Slide 1 The Simplex Method Pivoting, an Animation.
Chapter 6 Linear Programming: The Simplex Method
1. The Simplex Method for Problems in Standard Form 1.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
Determinants of 2 x 2 and 3 x 3 Matrices By: Jeffrey Bivin Lake Zurich High School
Linear Inequalities and Linear Programming Chapter 5
The Simplex Method: Standard Maximization Problems
5.4 Simplex method: maximization with problem constraints of the form
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
1 Linear programming simplex method This presentation will help you to solve linear programming problems using the Simplex tableau.
LINEAR PROGRAMMINGExample 1 MaximiseI = x + 0.8y subject tox + y  x + y  x + 2y  2400 Initial solution: I = 0 at (0, 0)
5.6 Maximization and Minimization with Mixed Problem Constraints
Graphing Parabolas Using the Vertex Axis of Symmetry & y-Intercept By: Jeffrey Bivin Lake Zurich High School Last Updated: October.
By: Jeffrey Bivin Lake Zurich High School Last Updated: October 30, 2006.
Learning Objectives for Section 6.2
Recursive Functions, Iterates, and Finite Differences By: Jeffrey Bivin Lake Zurich High School Last Updated: May 21, 2008.
Exponential and Logarithmic Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: January 30, 2008.
MATRICES Jeffrey Bivin Lake Zurich High School Last Updated: October 12, 2005.
Chapter 6 Linear Programming: The Simplex Method
EE/Econ 458 The Simplex Method using the Tableau Method
Simplex Algorithm.Big M Method
MIT and James Orlin © –Developed by James Orlin, MIT Animation of the Gauss-Jordan Elimination Algorithm.
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.
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.
Setting Up the Initial Simplex Tableau and Finding the Pivot Element Example 4.2 # 17 Produced by E. Gretchen Gascon.
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.
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.
Logarithmic Properties & Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: January 30, 2008.
Graphs of Polynomial Functions
Exponential and Logarithmic Functions Section 5.4.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization 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 three  constraints.
Chapter 4 Linear Programming: The Simplex Method
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
THE SIMPLEX ALGORITHM Step 1 The objective row is scanned and the column containing the most negative term is selected (pivotal column) - indicate with.
Relations and Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: November 14, 2007.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
Graphing Lines slope & y-intercept & x- & y- intercepts Jeffrey Bivin Lake Zurich High School Last Updated: September 6, 2007.
Gomory Cuts Updated 25 March Example ILP Example taken from “Operations Research: An Introduction” by Hamdy A. Taha (8 th Edition)“Operations Research:
Systems of Equations Gaussian Elimination & Row Reduced Echelon Form by Jeffrey Bivin Lake Zurich High School Last Updated: October.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ 5.5 Dual problem: minimization.
Jeff Bivin -- LZHS Last Updated: April 7, 2011 By: Jeffrey Bivin Lake Zurich High School
Exponential and Logarithmic Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: January 2, 2006.
Matrix Working with Scalars by Jeffrey Bivin Lake Zurich High School Last Updated: October 11, 2005.
Rational Expon ents and Radicals By: Jeffrey Bivin Lake Zurich High School Last Updated: December 11, 2007.
THE UNIT CIRCLE Day , (1, 0) (-1, 0) (0, 1) (0, -1)
Matrix Multiplication. Row 1 x Column X 25 = Jeff Bivin -- LZHS.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Inverses By: Jeffrey Bivin Lake Zurich High School Last Updated: November 17, 2005.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
Lake Zurich High School
Matrix Multiplication Example 1 Original author: Jeffrey Bivin, Lake Zurich High School.
5.5 Dual problem: minimization with problem constraints of the form Associated with each minimization problem with constraints is a maximization problem.
Matrix Multiplication
Linear programming Simplex method.
The Simplex Method: Standard Minimization Problems
Jeffrey Bivin Lake Zurich High School
Linear programming Simplex method.
Recursive Functions and Finite Differences
Matrix Multiplication
LINEAR PROGRAMMING Example 1 Maximise I = x + 0.8y
Presentation transcript:

Using Spreadsheets for Linear Programming with The Simplex Method A sample problem By: Jeffrey Bivin Lake Zurich High School Last Updated: October 11, 2005

A landscaper can buy three types of 100-pound bags of fertilizer, type A, type B, and type C. Each 100- pound bag of type A fertilizer costs $20 and contains 40 pounds of nitrogen, 30 pounds of phosphoric acid, and 10 pounds of potash. Each 100-pound bag of type B fertilizer costs $30 and contains 20 pounds of nitrogen, 20 pounds of phosphoric acid, and 55 pounds of potash. Each 100-pound bag of type C fertilizer costs $20 and contains no nitrogen, 30 pounds of phosphoric acid, and 40 pounds of potash. The landscaper requires 4000 pounds of nitrogen pounds of phosphoric acid, and 2000 pounds of potash. How many bags of each type of fertilizer should the landscaper buy in order to minimize the cost? Also, find the minimum cost. Jeff Bivin -- LZHS

Analyzing the problem Nitrogen Phos. Acidpotash Type Ax1x1 $ Type Bx2x2 $ Type Cx3x3 $ needs Jeff Bivin -- LZHS

Define the Constraints 40x x 2 > x x x 3 > x x x 3 > 2000 x1 > 0 x2 > 0 x3 > 0 Jeff Bivin -- LZHS

Function to minimize z = 20x x x 3 Jeff Bivin -- LZHS

Initial Tableau x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Initial Tableau Analysis Jeff Bivin -- LZHS

A negative basic variable in s 1 leads us to use column x 1 as the pivot column. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

A negative basic variable in s 1 leads us to use column x 1 as the pivot column. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues s 1 is a basic variable because it has only one non-zero element in the column Jeff Bivin -- LZHS

A negative basic variable in s 1 leads us to use column x 1 as the pivot column. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues We use Column x 1 as the pivot column because the 40 in column x 1 is the left most positive number in the row with the -1 value (negative basic variable). Jeff Bivin -- LZHS

Divide the value column by the pivot column. This adds an additional column at the right. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

is the lowest non-negative quotient. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

is the lowest non-negative quotient. Therefore, 30 is determined to be the pivot point. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Determine the row operations: row1 = 3 x row1 – 4 x row2 row3 = 3 x row3 – row2 row4 = 3 x row4 – 2 x row2 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Perform the row operations to determine Tableau 2 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r1=3r1-4r r r3=3r3-r r4=3r4-2r Jeff Bivin -- LZHS

2 nd Tableau Analysis Jeff Bivin -- LZHS

A negative basic variable in s 1 leads us to use column s 2 as the pivot column. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Divide the value column by the pivot column. This adds an additional column at the right. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

1000 is the lowest non-negative quotient. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

1000 is the lowest non-negative quotient. Therefore, 4 is determined to be the pivot point. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Determine the row operations: row2 = 4 x row2 + row1 row3 = 4 x row3 – row1 row4 = 2 x row4 – row1 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Perform the row operations to determine Tableau 3 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r r2=4r2+r r3=4r3-r r4=2r4-r Jeff Bivin -- LZHS

3 rd Tableau Analysis Jeff Bivin -- LZHS

A negative basic variable in s 3 leads us to use column x 2 as the pivot column. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r r2=4r2+r r3=4r3-r r4=2r4-r Jeff Bivin -- LZHS

Divide the value column by the pivot column. This adds an additional column at the right. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r r2=4r2+r r3=4r3-r r4=2r4-r Jeff Bivin -- LZHS

is the lowest non-negative quotient. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r r2=4r2+r r3=4r3-r r4=2r4-r Jeff Bivin -- LZHS

is the lowest non-negative quotient. Therefore, 30 is determined to be the pivot point. x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r r2=4r2+r r3=4r3-r r4=2r4-r Jeff Bivin -- LZHS

Determine the row operations: row1 = 30 x row1 + row3 row2 = 10 x row2 – row3 row4 = 5 x row4 – row3 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Perform the row operations to determine Tableau 4 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r1=30r1+r r2=10r2-r r r4=52r4-r Jeff Bivin -- LZHS

4 th Tableau Analysis Jeff Bivin -- LZHS

Now we can determine the solutions x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Basic Variables x 1, x 2, and s 2 are all positive and the bottom row has all positive variable coefficients Jeff Bivin -- LZHS

Determining the solutions: from row 1: s 2 = / 120 = 1100 from row 2: x 1 = / 1200 = 90 from row 3: x 2 = / 600 = 20 from row 4: z = -( / 30) = 2400 also: x 3 = s 1 = s 3 = 0 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r1=30r1+r r2=10r2-r r r4=52r4-r Jeff Bivin -- LZHS

Results x 1 = 90 x 2 = 20 x 3 = 0 s 1 = 0 s 2 = 1100 s 3 = 0 z = 2400 Jeff Bivin -- LZHS

Process Complete Answer the Question The minimum cost is $2400 when you order 90 bags of type A fertilizer 20 bags of type B fertilizer 0 bags of type C fertilizer Jeff Bivin -- LZHS

A Quick Recap Jeff Bivin -- LZHS

Initial Tableau x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues Jeff Bivin -- LZHS

Perform the row operations to determine Tableau 2 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r1=3r1-4r r r3=3r3-r r4=3r4-2r Jeff Bivin -- LZHS

Perform the row operations to determine Tableau 3 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r r2=4r2+r r3=4r3-r r4=2r4-r Jeff Bivin -- LZHS

Perform the row operations to determine Tableau 4 x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r1=30r1+r r2=10r2-r r r4=52r4-r Jeff Bivin -- LZHS

x1x1 x2x2 x3x3 s1s1 s2s2 s3s3 zValues r1=30r1+r r2=10r2-r r r4=52r4-r Determine the solutions from the 4 th Tableau from row 1: s 2 = / 120 = 1100 from row 2: x 1 = / 1200 = 90 from row 3: x 2 = / 600 = 20 from row 4: z = -( / 30) = 2400 also: x 3 = s 1 = s 3 = 0 Jeff Bivin -- LZHS

Process Complete Answer the Question The minimum cost is $2400 when you order 90 bags of type A fertilizer 20 bags of type B fertilizer 0 bags of type C fertilizer Jeff Bivin -- LZHS