Scribd
Upload
4 views

1.3 Optimizing With Linear Programming

Uploaded by

Fatima Abrar Shah
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

1.3 Optimizing With Linear Programming

Uploaded by

Fatima Abrar Shah
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

LINEAR

SYSTEMS AND
MATRICES
CHAPTER ONE
OPTIMIZING
WITH LINEAR
P R O G RA M M I N
G
LESSON 1.3
OBJECTIVES

Find the maximum Solve real-world optimization


and minimum values problems using linear
of a function over a programming.
region.
NEW VOCABULARY

01 02 03 04 05
Linear Feasible bounded Unbound optimize
programmi region ed
ng
REVIEW
Solve the system of inequalities by graphing.
x≤2
y>3

A. B.

C. D.
Solve the system of inequalities by graphing.
y ≤ 3x + 2
y > –x

A. B.

C. D.
MAXIMUM AND MINIMUM
VALUES
Situations often occur in business in which a company hopes to either maximize profits or
minimize costs, and many constraints need to be considered.

 These issues can often be addressed by the use of systems of inequalities in linear
programming.

Linear programming is a method for finding maximum or minimum values of a


function over a given system of inequalities with each inequality representing a constraint.
After the system is graphed and the vertices of the solution set, called the feasible region,
are substituted into the function, you can determine the maximum or minimum value.
BOUNDED REGION
Graph the following system of inequalities. Name the
coordinates of the vertices of the feasible region. Find
the maximum and minimum values of the function f(x, y)
= 3x – 2y for this region.
x≤5
y≤4
x+y≥2
Step 1 Graph the inequalities.

The polygon formed is a


triangle with vertices at
(–2, 4), (5, –3), and (5, 4).
Step 2 Use a table to find the maximum and minimum values of f(x, y).
Substitute the coordinates of the vertices into the function.

f(x, y) = 3x – 2y

← minimum
← maximum

Answer: The vertices of the feasible region are (–2, 4),


(5, –3), and (5, 4). The maximum value is 21 at (5, –3).
The minimum value is –14 at (–2, 4).
EXAMPLE 1: BOUNDED
REGION
Graph the system of inequalities. Name the coordinates of the
vertices of the feasible region. Find the maximum and minimum
values of the function for this region.

 Draw and shade above


Draw and shade below

STEP 1: Graph the inequalities and


locate the vertices
STEP 2: Evaluate the function at each
vertex

 The maximum value is at


 The minimum value is at
EXAMPLE 2: BOUNDED
REGION
Graph the system of inequalities. Name the coordinates of the
vertices of the feasible region. Find the maximum and minimum
values of the function for this region.

STEP 1: Graph the inequalities and


locate the vertices
STEP 2: Evaluate the function at each
vertex

 The maximum value is at


 The minimum value is at
EXAMPLE 3: UNBOUNDED
REGION
Graph the system of inequalities. Name the coordinates of the
vertices of the feasible region. Find the maximum and minimum
values of the function for this region.

STEP 1: Graph the inequalities and


locate the vertices
STEP 2: Evaluate the function at each
vertex

The maximum value is at There is no minimum value. Notice that


another point in the feasible region, yields a value of , which
is less
DO IT YOURSELF
OPTIMIZATION
To optimize means to seek the best price or amount to minimize costs
or maximize profits. This is often obtained with the use of linear
programming
REAL WORLD PROBLEM
An electronics company produces digital audio players and phones. A sign on
the company bulletin board is shown. If at least 2000 items must be produced
per shift, how many of each type should be made to minimize costs?
The company is experiencing limitations, or constraints, on production caused
by customer demand, shipping, and the productivity of their factory. A
system of inequalities can be used to represent these constraints.
END

You might also like