Chapter 7 Linear Programming Continued file 7a. Here is a basic linear programming problem. We want to Maximize profit = 7x1 + 5x2, but we have constraints.

Slides:



Advertisements
Similar presentations
5.7 Quadratic Inequalities
Advertisements

4.1 Introduction to Matrices
Chapter 5: Linear Programming: The Simplex Method
Example 1 Matrix Solution of Linear Systems Chapter 7.2 Use matrix row operations to solve the system of equations  2009 PBLPathways.
Assignment (6) Simplex Method for solving LP problems with two variables.
Chapter 7 Introduction to Linear Programming. Linear? To get a feel for what linear means let’s think about a simple example. You have $10 to spend and.
5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Solving Quadratic Equations using Factoring.  has the form: ax 2 + bx + c = 0 If necessary, we will need to rearrange into this form before we solve!
1 Chapter 7 Linear Programming Models Continued – file 7c.
INTRODUCTORY MATHEMATICAL ANALYSIS For Business, Economics, and the Life and Social Sciences  2007 Pearson Education Asia Chapter 7 Linear Programming.
D1: Linear Programming.
Solving Equations with the Variable on Both Sides
4.2 Systems of Linear Equations in Three Variables BobsMathClass.Com Copyright © 2010 All Rights Reserved. 1 The Graph of a Three Variable Equation Recall.
EXAMPLE 3 Write an equation for a function
10-3: Solving Quadratic Equations
Here are some examples:
Substitution. There are 3 different ways to solve linear equations: 1. Substitution 2. Elimination 3. Graphing We will focus on a new one each day. Today.
Chapter 12 Section 12.1 The Geometry of Linear Programming.
What are quadratic equations, and how can we solve them? Do Now: (To turn in) What do you know about quadratic equations? Have you worked with them before?
Solving Rational Equations
Systems of Inequalities in Two Variables Sec. 7.5a.
Copyright © 2011 Pearson, Inc. 7.5 Systems of Inequalities in Two Variables.
Warm Up 1. Graph the inequality y < 2x + 1. Solve using any method. 2. x 2 – 16x + 63 = x 2 + 8x = 3 7, 9.
Intermediate Tier - Algebra revision Contents : Collecting like terms Multiplying terms together Indices Expanding single brackets Expanding double.
Systems of Equations and Inequalities Systems of Linear Equations: Substitution and Elimination Matrices Determinants Systems of Non-linear Equations Systems.
Solving Quadratic Equations by Factoring January 6, 2015 Pages
Linear Programming Solving Systems of Equations with 3 Variables Inverses & Determinants of Matrices Cramer’s Rule.
(409)539-MATH THE MATH ACADEMY (409)539-MATH.
Fundamentals of Engineering Analysis
Copyright © Cengage Learning. All rights reserved. 7 Linear Systems and Matrices.
Example 1A Solve the equation. Check your answer. (x – 7)(x + 2) = 0
Warm-up Solve each system of equations:
Simplex Method for solving LP problems with two variables.
1 Beginning & Intermediate Algebra – Math 103 Math, Statistics & Physics.
Math 20-1 Chapter 5 Radical Expressions and Equations
§ 6.6 Solving Quadratic Equations by Factoring. Martin-Gay, Beginning and Intermediate Algebra, 4ed 22 Zero Factor Theorem Quadratic Equations Can be.
Linear Programming The Table Method. Objectives and goals Solve linear programming problems using the Table Method.
SYSTEMS OF EQUATIONS. SYSTEM OF EQUATIONS -Two or more linear equations involving the same variable.
Holt McDougal Algebra Solving Quadratic Inequalities Solve quadratic inequalities by using tables and graphs. Solve quadratic inequalities by using.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Notes Over 3.1 Solving a System Graphically Graph the linear system and estimate the solution. Then check the solution algebraically.
EXAMPLE 1 Solve a system graphically Graph the linear system and estimate the solution. Then check the solution algebraically. 4x + y = 8 2x – 3y = 18.
Example 3.2 Graphical Solution Method | 3.1a | a3.3 Background Information n To illustrate the graphical approach, we will use a slightly.
Solving Absolute Value Equations & Inequalities
Opener #3 (8/27/10) Solving Equations and Inequalities
Chapter 5 Linear Inequalities and Linear Programming
Copyright 2013, 2010, 2007, 2005, Pearson, Education, Inc.
Linear Systems November 28, 2016.
5.5 a Writing Linear Equations in Standard Form
Linear programming Simplex method.
SECTION 9-3 : SOLVING QUADRATIC EQUATIONS
Solve a system of linear equation in two variables
Ch 5 Review.
Multiplicative Inverses of Matrices and Matrix Equations
Students will write a summary explaining how to use Cramer’s rule.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
1.4 Solving Absolute-Value Equations
Linear programming Simplex method.
Warm Up Solve for x:
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
1.4 Solving Absolute-Value Equations
Bellwork 1) Multiply. 3) Find the determinant. 2) Multiply.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Finding the Zeroes.
Example 1: Solving Rational Equations
ALGEBRA I - REVIEW FOR TEST 2-1
Warm- Up: Solve by Substitution
Maths Unit 25 – Solving Equations
Solving Linear Equations
Presentation transcript:

Chapter 7 Linear Programming Continued file 7a

Here is a basic linear programming problem. We want to Maximize profit = 7x1 + 5x2, but we have constraints 4x1 + 3x2 <= 240 2x1 + 1x2 <= 100, Where x1 stands for tables and x2 stands for chairs and <= means less than or equal to. The point is we want to make as much profit as we can by making tables and chairs, but we face constraints that give us road blocks to overcome.

Both constraints x2 x1 Feasible region We saw this feasible region for the product mix problem and saw in theory how the isoprofit line solution method could give us the answer. And as I suggested with the three examples, the solution will probably be at a corner. The corner solution method says just check profit at the corners - choose These are corners Corner with highest profit.

Corner point solution method The corners at the axes are relatively easy to check. Plug the x1 and x2 values into profit and see what number is obtained. The corner inside the graph is a little harder to find in math terms. A math systems of equations approach will never fail you. You are expected to have studied the method in your past and use it here. You can do so, but the method takes practice to get the tricks of the trade down. I want to show you a way to find the inside corner point with matrix algebra. Essentially we are finding where the two constraints cross.

Matrix algebra You are familiar with the basic algebra of equations like 2 x = 4. To solve for x you take 4/2 = 2. It turns out we could write x = , where the 2 raised to the power -1 really says divide. In general we have Ax = w and x = A -1 w. Now think about our two constraints in equality form 4x1 + 3x2 = x1 = 240 2x1 + 1x2 = x2 100 In this second form with brackets you can see we would have Ax = w, where A, x and w now are tables with columns and rows (sometimes only one column). We need to learn a few rules here, but it is easy. What does A -1 really mean now?

Matrix algebra Here I want you to see how the matrix is formed 4x1 + 3x2 = x1 = 240 2x1 + 1x2 = x2 100 This first row is The 4 and x1 split The 3 and x2 split Similar process for the second line.

Matrix algebra In general say A = ab cd. Then A -1 = 1/(ad - cb) d -b -c a. Example A = Then A -1 = 1/(4- 6) 1 -3 =

Matrix algebra x = A -1 w or x1 = = (-.5)(240) + 1.5(100) = 30 x (1)(240) + (-2)(100) 40 Nothing to it! The other methods require the building up of some skill. This is just a BRUTE FORCE method, it will never fail. Note: Dividing by zero would mean the solution is undefined. Here that would mean the curves do not cross.

Corner points Our three corner points are (50, 0), (0, 80) and (30, 40). Profit is 7x1 + 5x2. Profit at each point (50, 0) 350 (0, 80) 400 (30, 40) 410. Corner (0, 0) should also be checked - profit is 0 there. 410 is highest profit. Make 30 tables and 40 chairs.