7-3 Systems of Inequalities

Unit 7 Systems and Matrices

Concepts and Objectives

Systems of Inequalities (Obj. #25)

Graph systems of inequalities

Identify solutions to systems of inequalities

Use linear programming to identify maximums and

minimums
Graphing Review

To graph a linear inequality, put the inequality into
slope-intercept form.

Plot the y-intercept and count the slope from there (rise
over run)
Symbol Line Shade
< below
> above
≤ below
≥ above
Graphing Review

Example: Graph the solution to 2x + 3 y > 6
3 y > −2 x + 6
2
y > − x +2
3
Graphing Review

Example: What is the solution to y ≥ x 2 − 2 ?

Vertex: (0, –2)

Systems of Inequalities

The solution to a system of inequalities will be the graph
of the overlap between the two (or more) inequalities.

You must graph the system to show the solution.

If the inequalities do not overlap, then there is no
solution to the system.
Systems of Inequalities

Example: What is the solution to the system?
 x − 2 y > −4

3x + y ≤ 2

Inequality #1: −2 y > − x − 4

1
y < x +2
2
Systems of Inequalities

Example: What is the solution to the system?
 x − 2 y > −4

3x + y ≤ 2

Inequality #2: y ≤ −3x + 2

Linear Programming

An important application of mathematics is called linear
programming. We use linear programming to find an
optimum value.

To solve a linear programming problem:

Translate the problem into symbols.

Write all of the relevant inequalities. These

constraints form the system of inequalities.

Define the function to be maximized/minimized,
which is called the objective function.

The solution, if it exists, occurs at a vertex of the
region of feasible solutions.
Linear Programming

Example: An office manager wants to buy some filing
cabinets. He knows that cabinet A costs $10 each,
requires 6 sq. ft. of floor space, and holds 8 cu. ft. of files.
Cabinet B costs $20 each, requires 8 sq. ft. of floor space,
and holds 12 cu. ft. of files. He can spend no more than
$140 due to budget limitations, and his office has room
for no more than 72 sq. ft. of cabinets. He wants to
maximize storage capacity within the limits imposed by
funds and space. How many of each type of cabinet
should he buy?
Linear Programming

Example (cont.):
Let x = # of cabinet A units
y = # of cabinet B units

Inequality #1: 10 x + 20 y ≤ 140 (cost)

Inequality #2: 6 x + 8 y ≤ 72 (square footage)

Also, neither x nor y can be negative

Linear Programming

Example (cont.):
 1
 y ≤ − x +7
2

y ≤ −3 x +9
 4

y ≥0
x ≥ 0


The optimal number of cabinets is
at the vertex of the system: (8, 3)

8 Cabinet A and 3 Cabinet B will store 100 cu. ft. of files.
Homework

College Algebra (brown book)

Page 905: 30, 34-36, 39, 42, 59-62, 77, 80

Turn in: 30, 34, 42, 60, 61, 80