Chapter 7: Matrices and Systems of Equations and Inequalities

Copyright © 2007 Pearson Education, Inc. Slide 7-1


Chapter 7: Matrices and Systems of Equations and Inequalities

7.1 Systems of Equations

7.2 Solution of Linear Systems in Three Variables

7.3 Solution of Linear Systems by Row Transformations

7.4 Matrix Properties and Operations

7.5 Determinants and Cramer’s Rule

7.6 Solution of Linear Systems by Matrix Inverses

7.7 Systems of Inequalities and Linear Programming

7.8 Partial Fractions


• Many mathematical descriptions of real situations are best described as inequalities rather than equations. Some examples:– Using a machine no more than 12 hours a day– Producing at least 500 cases of a certain product to

meet a contract

• A line divides a plane into three sets of points:

1. Points on line r,2. Points in half-plane P, and3. Points in half-plane Q.

7.7 Systems of Inequalities and Linear Programming


7.7 Solving Linear Inequalities

• A linear inequality in two variables can take the form

where A, B, and C are real numbers. The inequality symbol can be replaced with , <, or >.

• The graph of a linear inequality is a half-plane.

,CByAx


Example Graph

Solution The boundary line is Since the

points on this line do not satisfy we use a dashed line in the graph.

7.7 Solving Linear Inequalities

.44 yx

.44 yx

141

44

xy

yx

,44 yx

The half-plane is above the boundary line.


Example Graph the solution set of the system.

Graphing Calculator Solution Solve each equation for y. Then let

7.7 Solving Systems of Inequalities

yx

yx

2

262

.2

Yand2

6Y

2

21

xx


Analytic Solution Graph the boundary equationsx = 6 – 2y and x2 = 2y and find the boundary points(the points of intersection) using the methods from §7.1.

7.7 Solving Systems of Inequalities


7.7 Linear Programming

• An important application of mathematics to business and social science is linear programming.

• Linear programming is used to find an optimum value.

- minimum cost

- maximum profit• First developed to solve problems in allocating

supplies for the U.S.Air Force during WWII.


The Charlson Company makes two products: VCRs and DVD players. Each VCR gives a profit of $30, while each DVD player produces a $70 profit. The company must manufacture at least 10 VCRs per day to satisfy one of its customers, but no more than 50 because of production problems. The number of DVD players produced cannot exceed 60 per day, and the number of VCRs cannot exceed the number of DVD players. How many of each should the company manufacture to obtain maximum profit?

Let x = number of VCRs to be produced daily,

and y = number of DVD players to be produced daily.

7.7 Linear Programming Example


At least 10 VCRs must be produced, but no more than 50, sox 10 and x 50.

No more than 60 DVD players may be made in one day, soy 60.

Number of VCRs may not exceed the number of DVD players:x y.

The number of VCRs and DVD players cannot be negative, sox 0 and y 0.

These restrictions, or constraints, form the system of inequalities:

x 10, x 50, y 60, x y, x 0, y 0.



To find the maximum possible profit, sketch the graph of each constraint. Find the intersection of the feasible values of x and y; they must satisfy all constraints. Then maximize the objective function: profit = 30x + 70y.


Figure 71 pg 7-291

This area is called the region of feasible solutions.

0 = 30x + 70y1000 = 30x + 70y3000 = 30x + 70y7000 = 30x + 70y

profit = 30x + 70y

Figure 72 pg 7-292 Figure 73 pg 7-292

The coordinates (50, 60) on the line 5700 = 30x + 70ygive a maximum profit.


7.7 Fundamental Theorem of Linear Programming

• Solving a Linear Programming Problem1. Write the objective function and all necessary

constraints.2. Graph the feasible region.3. Identify all vertices or corner points.4. Find the value of the objective function at each

vertex.5. The solution is given by the vertex producing the

optimum value of the objective function.

Fundamental Theorem of Linear Programming

The optimum value for a linear programming problem occurs at a vertex of the region of feasible solutions.


Robin takes vitamin pills each day. She wants at least 16 units of Vitamin A, at least 5 units of Vitamin B1, and at least 20 units of Vitamin C. She can choose between red pills, costing 10¢ each, that contain 8 units of A, 1 of B1, and 2 of C; and blue pills, costing 20¢ each, that contain 2 units of A, 1 of B1, and 7 of C. How many of each pill should she buy to minimize her cost and yet fulfill her daily requirements?

Solution Let x = number of red pills to buy, and y = number of blue pills to buy.

The objective function:cost = 10x + 20y pennies per day

7.7 Finding Minimum Cost


Restrictions:

7.7 Finding Minimum Cost

0,

2072

5

1628

yx

yx

yx

yx At least 16 units of A, 8 from red, 2 from blue.

At least 5 units of B1, 1 from red and 1 from blue.

At least 20 units of C, 2 from red, 7 from blue.

The number of each type of pill cannot be negative.

Robin’s best bet is to buy 3 red pills and 2 blue ones for a cost of 70¢ per day.

Documents

Chapter 7: Matrices and Systems of Equations and Inequalities