Matrices and Systems of Equations

Similar documents
6.3 Notes O Brien F15

10/26/ Solving Systems of Linear Equations Using Matrices. Objectives. Matrices

EXTENSION. a 1 b 1 c 1 d 1. Rows l a 2 b 2 c 2 d 2. a 3 x b 3 y c 3 z d 3. This system can be written in an abbreviated form as

3. Replace any row by the sum of that row and a constant multiple of any other row.

Precalculus Notes: Unit 7 Systems of Equations and Matrices

WEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1)

For example, the system. 22 may be represented by the augmented matrix

Systems of Inequalities and Linear Programming 5.7 Properties of Matrices 5.8 Matrix Inverses

Matrix Inverse 2 ( 2) 1 = 2 1 2

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program

3.1 Solving Systems Using Tables and Graphs

Solving Systems Using Row Operations 1 Name

Review for Mastery Using Graphs and Tables to Solve Linear Systems

Finite Math - J-term Homework. Section Inverse of a Square Matrix

MATH 2000 Gauss-Jordan Elimination and the TI-83 [Underlined bold terms are defined in the glossary]

Section 3.1 Gaussian Elimination Method (GEM) Key terms

CHAPTER 4 Linear Programming with Two Variables

x = 12 x = 12 1x = 16

Mathematics for Business and Economics - I. Chapter7 Linear Inequality Systems and Linear Programming (Lecture11)

Question 2: How do you solve a linear programming problem with a graph?

Practice Test - Chapter 6

MAT 103 F09 TEST 3 REVIEW (CH 4-5)

Finite Math Linear Programming 1 May / 7

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011

Graphing Linear Inequalities in Two Variables.

Linear Programming. You can model sales with the following objective function. Sales 100x 50y. x 0 and y 0. x y 40

College Algebra Exam File - Fall Test #1

Objectives and Homework List

Activity One: Getting started with linear programming. This problem is based on a problem in the Algebra II Indicators for Goal 1.

Solutions for Operations Research Final Exam

Section 18-1: Graphical Representation of Linear Equations and Functions

Ahigh school curriculum in Algebra 2 contains both solving systems of linear equations,

c) How many students took none of the three subjects?

3-8 Solving Systems of Equations Using Inverse Matrices. Determine whether each pair of matrices are inverses of each other. 13.

6.5. SYSTEMS OF INEQUALITIES

0_PreCNotes17 18.notebook May 16, Chapter 12

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang

Math 20 Practice Exam #2 Problems and Their Solutions!

Name: THE SIMPLEX METHOD: STANDARD MAXIMIZATION PROBLEMS

Exercise Set Decide whether each matrix below is an elementary matrix. (a) (b) (c) (d) Answer:

Farming Example. Lecture 22. Solving a Linear Program. withthe Simplex Algorithm and with Excel s Solver

Solutions of Equations An ordered pair will be a solution to an equation if the equation is when the numbers are substituted into the equation.

3.1 Graphing Linear Inequalities

YEAR 12 Trial Exam Paper FURTHER MATHEMATICS. Written examination 1. Worked solutions

Systems of Equations and Inequalities. Copyright Cengage Learning. All rights reserved.

CHAPTER HERE S WHERE YOU LL FIND THESE APPLICATIONS:

MAT 003 Brian Killough s Instructor Notes Saint Leo University

Optimization of Design. Lecturer:Dung-An Wang Lecture 8

Linear Equations in Linear Algebra

Graphing Linear Equations

Conic Sections. College Algebra

Run Menu. Order of Operations. Example: x Enter the expression as it appears and press [EXE]

FOM 11 Practice Test Name: Ch. 6 Systems of Inequalities Block:

Using Linear Programming for Management Decisions

Curriculum Map: Mathematics

Math 135: Intermediate Algebra Homework 10 Solutions December 18, 2007

Section Graphing Systems of Linear Inequalities

Linear Programming Terminology

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

Linear Equation Systems Iterative Methods

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.

Chapter 4 Linear Programming

Section 4.5 Linear Inequalities in Two Variables

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

The Simplex Algorithm

Lesson 6.1 Matrix Representations

1. List the Intercepts of the Inequality and then sketch the graph using the Math 125 method of shading

Course Number 432/433 Title Algebra II (A & B) H Grade # of Days 120

MA30SA Applied Math Unit D - Linear Programming Revd:

Summer Review for Students Entering Pre-Calculus with Trigonometry. TI-84 Plus Graphing Calculator is required for this course.

Numerical Methods 5633

The point (x, y) lies on the circle of radius r and center (h, k) iff. x h y k r

CHAPTER 12: LINEAR PROGRAMMING

13.1 2/20/2018. Conic Sections. Conic Sections: Parabolas and Circles

CDG2A/CDZ4A/CDC4A/ MBT4A ELEMENTS OF OPERATIONS RESEARCH. Unit : I - V

OPTIMIZATION: Linear Programming

Chapter II. Linear Programming

A Poorly Conditioned System. Matrix Form

Foundations of Mathematics 11

Lecture 14. Resource Allocation involving Continuous Variables (Linear Programming) 1.040/1.401/ESD.018 Project Management.

I will illustrate the concepts using the example below.

2.6: Solving Systems of Linear Inequalities

Artificial Intelligence

Independent systems consist of x

Chapter 3 Linear Programming: A Geometric Approach

Reteaching Transforming Linear Functions

LINEAR PROGRAMMING. Chapter Overview

2. Use elementary row operations to rewrite the augmented matrix in a simpler form (i.e., one whose solutions are easy to find).

Three Dimensional Geometry. Linear Programming

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.

Math 13 Chapter 3 Handout Helene Payne. Name: 1. Assign the value to the variables so that a matrix equality results.

Math 2 Coordinate Geometry Part 3 Inequalities & Quadratics

Section 2.0: Getting Started

Warm-up for Foundations of Precalculus

1. Answer: x or x. Explanation Set up the two equations, then solve each equation. x. Check

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.

College Prep Algebra II Summer Packet

Chapter 4. Linear Programming


Transcription:

1 CA-Fall 2011-Jordan College Algebra, 4 th edition, Beecher/Penna/Bittinger, Pearson/Addison Wesley, 2012 Chapter 6: Systems of Equations and Matrices Section 6.3 Matrices and Systems of Equations Matrices A rectangular array of numbers is called a matrix (plural, matrices). The rows of a matrix are. The columns of a matrix are vertical. A matrix with m rows and n columns is said to be of order. Example 1 Determine the order of the following matrix: Augmented Matrix An augmented matrix is written using the coefficients and constants from a system of linear equations. Example 2 Write the augmented matrix for the following system of equations. -x 8y + 5z = 17-6x + 12z = -24 3x + y 8z = 11 Example 3 Write the system of equations that corresponds to the following augmented matrix. Example 4 Write the system of equations that corresponds to the following augmented matrix. Reduced Row-Echelon Form Our goal is take an augmented matrix from a system of linear equations and put it in reduced row-echelon form using Gauss-Jordan elimination.

Review of Solving Systems of Equations Using Substitution and/or Elimination 2 Example 5 Solve the system: 5x 3y = 14 4x + y = 18 Gauss-Jordan Elimination This is a method of solving systems of equations using matrices and is very useful if the systems are large. Steps for Gauss-Jordan Elimination and ROWOPS (calculator program) Write the augmented matrix on paper. Enter the matrix in the calculator: MATRX EDIT 1: Type in the order of the matrix and then the elements of the matrix, pressing ENTER after each input. The process is worked out column by column. Within each column you want to obtain 1 as the diagonal element first and then obtain the 0s within the rest of the column second. After a column is complete with 1 and then 0s, you move to the next column. To obtain 1 as the diagonal element, you multiply the entire row by the reciprocal of the current number. Write the row operation to be performed beside the paper matrix. On the calculator press PRGM and choose the program called ROWOPS. Press ENTER. You should see your original matrix displayed on the calculator screen. Double-check for data entry errors. Press ENTER again. You should see four choices. Choose 2 TO MULTIPLY and press ENTER. Enter in the row number and press ENTER and the reciprocal and press ENTER. Your next matrix will be displayed on the screen with a 1 as the first diagonal element. This 1 that was just obtained is called the pivot element. Write this matrix on paper. The next step is to obtain 0s in the rest of the column by using opposites. Multiply the row that you just obtained the 1 in by the opposite of the number to be changed and then add that result back to the row to be changed. Write this row operation beside the paper matrix. This process is called pivoting. Press ENTER in the calculator and then choose 3 TO PIVOT. You will need to enter the row number where the pivot is located (the 1 from above) and press ENTER and then the column number where the pivot is located and press ENTER. For this process the row and column numbers will always be the same because the pivot element is always on the diagonal. Your next matrix will be displayed on the screen with the column complete with 1 on the diagonal and 0s elsewhere. Write this matrix on paper. Move to the next column and go to the diagonal element and transform it into a 1 using the process from above. Then obtain 0s in the rest of the column. Always write your matrix on paper and write down the row operation to transition to the next matrix. When the matrix is in reduced-row echelon form, your answers will be the numbers in the last column.

Example 6 Use Gauss-Jordan elimination to solve the system: 5x 3y = 14 4x + y = 18 3 Example 7 Use Gauss-Jordan elimination to solve the system: -x + 2y + 6z = 2 3x + 2y + 6z = 6 x + 4y 3z = 1 Example 8 Use Gauss-Jordan elimination to solve the system: 3x + y + 3z = 1 x + 2y z = 2 2x y + 4z = 4 Example 9 Use Gauss-Jordan elimination to solve the system: x + y 3z = 4 4x + 5y + z = 1 2x + 3y + 7z = -7 Example 10 Solve the following problem using Gauss-Jordan elimination with matrices. Pat Summers wins $200,000 in the Louisiana state lottery. He invests part of the money in real estate with an annual return of 3% and another part in a money market account at 2.5% interest. He invests the rest, which amounts to $80,000 less than the sum of the other two parts, in certificates of deposit that pay 1.5%. If the total annual interest on the money is $4900, how much was invested at each rate?

Section 6.7 Systems of Inequalities & Linear Programming 4 Graphing a Linear Inequality Pretend the inequality symbol is an equals sign to graph the boundary line. If the inequality symbol is < or >, use a boundary line. If the inequality symbol is or, use a boundary line. Choose a test point NOT on the boundary line and plug it into the inequality. If the inequality is true, shade the side containing the test point. If the inequality is false, shade the other side. Example 1 Graph: y > x 4 Example 2 Graph: 4y 3x 5 Example 3 Graph: y < 2 Graphing Systems of Inequalities Graph each inequality on the same coordinate axes (same graph). Lightly shade or mark which side is to be shaded for each inequality. The intersection of the shaded regions is called the feasible region. This region is your solution set and needs to be marked by shading. The vertices ( points) are the points where the boundaries intersect that border the feasible region. The word vertices is plural for vertex. Example 4 Graph the system of inequalities. Then find the coordinates of the vertices. x -2 y < 3 2x Example 5 Graph the system of inequalities. Then find the coordinates of the vertices. 8x + 5y 40 x + 2y 8 x 0 y 0

Linear Programming Linear programming is used to optimize (maximize or minimize) values subject to certain constraints. For example, you may want to maximize profit but you are restricted in how many hours a day you can run a machine or the number of employees you can hire. Linear programming was developed during World War II. It was used to allocate supplies for the U.S. Air Force. Constraints are expressed as inequalities. The function that we want to maximize or minimize is called the function. 5 Fundamental Theorem of Linear Programming If an optimal value for a linear programming problem exists, it occurs at a vertex of the feasible region. Solving a Linear Programming Problem Graphically Identify the variables. Write the objective function including whether it is to be maximized or minimized. Write the constraints including the implied constraints. Graph the feasible region from the constraints and identify the vertices (corner points). Graph paper is very helpful for these problems. Substitute each vertex into the objective function. Based on whether the objective function is to be minimized or maximized, the smallest result would be the minimum and the largest result would be the maximum. Example 6 Find the maximum and minimum values of the function and the values of x and y for which they occur: Q = 28x 4y + 72 subject to: 5x + 4y 20 0 y 4 0 x 3 Example 7 An airline with two types of airplanes, P 1 and P 2, has contracted with a tour group to provide transportation for a minimum of 2000 first-class, 1500 touristclass, and 2400 economy-class passengers. For a certain trip, airplane P 1 costs $12,000 to operate and can accommodate 40 first-class, 40 tourist-class, and 120 economy-class passengers, whereas airplane P 2 costs $10,000 to operate and can accommodate 80 first-class, 30 tourist-class, and 40 economy-class passengers. How many of each type of airplane should be used in order to minimize the operating cost?

Chapter 7: Conic Sections 6 Section 7.4 Nonlinear Systems of Equations & Inequalities Nonlinear Systems of Equations The solutions to these systems are points of intersection of the graphs from the system. You can expect to have no solution, one solution, or multiple solutions. We can solve nonlinear systems of equations by using the substitution or the elimination method. When some variables are squared and some are first-degree, try the substitution method. Solve one of the equations for one of the variables and substitute that result into the other equation. When all the variables have the same power, line them up vertically and try the elimination method. You may have to multiply one or both equations by a constant to be able to eliminate a variable. Example 1 Solve the system: x 2 + y 2 = 9 2x y = 3 Example 2 Solve the system: xy = 4 3x + 2y = -10 Example 3 Solve the system: 5x 2 2y 2 = -13 3x 2 + 4y 2 = 39 Example 4 For a student recreation building at Southport Community College, an architect wants to lay out a rectangular piece of land that has a perimeter of 204 m and an area of 2565 m 2. Find the dimensions of the piece of land. Nonlinear Systems of Inequalities These will be worked in the same manner as in section 5.7 except that at least one of the inequalities will not be linear. Example 5 Graph the solution set: x 2 + y 2 9 2x 3y > 6