The Management Science Approach

Maria Eagle is a Native American artisan. She works part time making
bowls and mugs by hand from special pottery clay and then sells her items
to the Beaver Creek Pottery Company, a Native American crafts guild. She
has 60 hours available each month to make bowls and mugs, and it takes
her 12 hours to make a bowl and 15 hours to make a mug. She uses 9
pounds of special clay to make a bowl, and she needs 5 pounds to make a
mug; Maria has 30 pounds of clay available each month. She makes a
profit of $300 for each bowl she delivers, and she makes $250 for each
mug. Determine all the possible combinations of bowls and mugs Maria
can make each month, given her limited resources, and select the most
profitable combination of bowls and mugs Maria should make each month.
Develop a model and solve this problem.
 MODEL CONSTRUCTION
Develop constraints for the following problems:
1. A manufacturer buys peas for vegetable pies from 2 cooperatives. The
price per unit is $6 from cooperative A, and $5.50 per unit from
cooperative B. The manufacturer needs at least 12000 units of peas.
Cooperative A can supply up to 8000 units, and cooperative B can
supply at least 6000 units. Develop constraints for these conditions.

2. The College Coffee Café buys tea from 3 suppliers. The price per pound
is $15.00 from supplier A, $17.50 from supplier B, and $21.00 from
supplier C. They have budged $175 to purchase the tea. The café needs
at least 12 pounds of tea, and supplier C can supply no more than 4
pounds. Develop constraints for these conditions.
LINEAR INEQUALITIES &
SYSTEMS Mr. John Llenord C. Villanueva
MGT 208
CABEIHM (BatStateU-TNEU)
• Graph linear inequalities in two variables on the coordinate
plane.
• Solve problems involving linear inequalities.
• Graph the solutions to systems of linear inequalities.
• Write and solve the systems of linear inequalities from real life
problems.

• How do you graph and solve systems of linear inequalities?

• How do you justify the solution/s to linear inequalities and
systems of linear inequalities?
 A linear inequality relates two variables
using an inequality symbol such as y > 2x – 4. Its
graph is a region (…or a wedge-shaped area) of
the coordinate plane bounded by a line.
Helpful Hint
Think of the underlines in the symbols ≤ and ≥ as representing solid
lines on the graph.
1. Graph the linear function 𝑦 = 𝑚𝑥 + 𝑏 3. Determine the area of solution to the linear
corresponding the given linear inequality. inequality. If 𝒚 > 𝒎𝒙 + 𝒃, shade above, if
You may use the slope-intercept form or 𝒚 < 𝒎𝒙 + 𝒃, shade below. You can also
the intercepts of the function. use test point to determine the shaded
region, usually the origin (0,0).
2. Determine if the boundary line is solid
≤ 𝑜𝑟 ≥ or dotted < 𝑜𝑟 > .
Graph the inequality .
y-intercept of 2 and a slope of . Check Choose a point in the solution region,
such as (3, 2) and test it in the inequality.
Draw the boundary line dashed
because it is not part of the solution.
Then shade the region above the
boundary line to show .
?

?
2>1ü
The test point satisfies the inequality, so
the solution region appears to be correct.
Graph the inequality y ≤ –1.

Recall that y= –1 is a horizontal line.

Step 1 Draw a solid line for y= –1 because

the boundary line is part of the graph.

Step 2 Shade the region below the boundary

line to show where y < –1.

Check The point (0, –2) is a solution

because –2 ≤ –1. Note that any point on or
below y = –1 is a solution, regardless of the
value of x.
Graph the inequality y ≥ 3x –2.
+3
The boundary line has a y–intercept of ____ Check Is (–3, 2) a solution to the inequality?
-2
and a slope of _____.
y ≥ 3x –2
solid line because it is part
Draw a ______
of the solution. ?
2 ≥ 3(–3) –2
above the
Then shade the region _______
?
boundary line to show y > 3x – 2. 2 ≥ (–9) –2

2 >? –11 ü

The test point satisfies the inequality, so

the solution region appears to be correct.
Graph 3x + 4y ≤ 12 using intercepts.
Step 1 Find the intercepts. Step 2 Draw the boundary line.
The line goes through (0, 3) and (4, 0). Draw a solid line for
y-intercept (is where x = 0) the boundary line because it is part of the graph.
3x + 4y = 12 Step 3 Find the correct region to shade.
3(0) + 4y = 12 Substitute (0, 0) into the inequality. Because 0 + 0 ≤ 12 is
true, shade the region that contains (0, 0).
4y = 12
y=3
x-intercept (is where y = 0)
(0, 3)
3x + 4y = 12
3x + 4(0) = 12
3x = 12 (4, 0)
x=4
Graph 3x – 4y > 12 using intercepts.
Step 1 Find the intercepts. Step 2 Draw the boundary line.
The line goes through (0, –3) and (4, 0). Draw the boundary
Substitute x = 0 and y = 0 into 3x – 4y = 12 line dashed because it is not part of the solution.
to find the intercepts of the boundary line.
Step 3 Find the correct region to shade.
y-intercept Substitute (0, 0) into the inequality. Because 0 + 0 >12
is false, shade the region that does not contain (0, 0).
3x – 4y = 12
3(0) – 4y = 12
– 4y = 12
y=–3 (4, 0)

x-intercept
3x – 4y = 12
3x – 4(0) = 12 (0, –3)
3x = 12
x=4
 Many applications of inequalities in two variables use only nonnegative values for the
variables. Graph only the part of the plane that includes realistic solutions.
A school carnival charges $4.50 for adults and $3.00 for children. The school needs to
make at least $135 to cover expenses.
A. Using x as the number of adult tickets and y as the number of child tickets, write and
graph an inequality for the amount the school makes on ticket sales.
An inequality that models the problem is 𝟒. 𝟓𝒙 + 𝟑𝒚 ≥ 𝟏𝟑𝟓.
Find the intercepts of the boundary line.
4.5(0) + 3y = 135 4.5x + 3(0) = 135
y = 45 x = 30
Graph the boundary line through (0, 45) and (30, 0) as a
solid line. Shade the region above the line that is in the first
quadrant, as ticket sales cannot be negative.
B. If 25 child tickets are sold, how many adult tickets must be
sold to cover expenses?
4.5x ≥ 60, so x ≥ 13.3
4.5x + 3(25) ≥ 135
4.5x + 75 ≥ 135 At least 14 adult tickets must be sold.
 A café gives away prizes. A large prize costs the café $125, and the small prize costs
$40. The café will not spend more than $1500. How many of each prize can be awarded? How
many small prizes can be awarded if 4 large prizes are given away?
A. Let x represent the number of small prizes and y represent the number of large prizes,
the total not too exceed $1500. Write an inequality to represent the situation.
An inequality that models the problem is 𝟒𝟎𝒙 + 𝟏𝟐𝟓𝒚 ≤ 𝟏𝟓𝟎𝟎.
Find the intercepts of the boundary line.
40(0) + 125y = 1500 40x + 125(0) = 1500
y = 12 x = 37.5
Graph the boundary line through (0, 12) and (37.5, 0) as a
solid line. Shade the region below the line that is in the
first quadrant, as prizes awarded cannot be negative.
B. If 4 large prizes are awarded,
40x + 125(4) ≤ 1500
x ≤ 25
40x + 500 ≤ 1500
40x ≤ 1000 No more than 25 small prizes can be awarded.
YOU TRY!
1. Graph 2x – 5y ³ 10 3. Potatoes cost a chef $18 a box, and carrots cost $12 a box.
using intercepts. The chef wants to spend no more than $144. Use x as the
number of boxes of potatoes and y as the number of boxes
of carrots.
a. Write an inequality for the number of boxes the chef
can buy.

2. Solve –6y < 18x – 12 for y.

Graph the solution.

b. How many boxes of potatoes can the chef order if she

orders 4 boxes of carrot?
SYSTEMS OF LINEAR
INEQUALITIES
Mr. John Llenord C. Villanueva
MGT 208
CABEIHM (BatStateU-TNEU)
• Graph linear inequalities in two variables on the coordinate
plane.
• Solve problems involving linear inequalities.
• Graph the solutions to systems of linear inequalities.
• Write and solve the systems of linear inequalities from real life
problems.

• How do you graph and solve systems of linear inequalities?

• How do you justify the solution/s to linear inequalities and
systems of linear inequalities?
System of Linear Inequalities
When a problem uses phrases like “greater than” or “no more than,” you
can model the situation using a system of linear inequalities.
A system of linear inequalities is a set of two or more linear
inequalities with the same variables. The solution to a system of inequalities is
often an infinite set of points that can be represented graphically by shading.
When you graph multiple inequalities on the same graph, the region where the
shadings overlap is the solution region.
y< –3
Graph the system of inequalities:
y ≥ –x + 2
Step 1: For y < – 3, graph the dashed boundary line
y= – 3, and shade below it.
Step 2: For y ≥ –x + 2, graph the solid boundary line y =
–x + 2, and shade above it.

Step 3: The overlapping region is the solution

region.
 2x - y ³ 4
Which of the following ordered pairs is a solution of the system ?
y < 2x - 6

a) 0,0 b) 7, 5 c) 0, −6
Helpful Hint
If you are unsure which direction to shade, use the origin as a test point.

Graph each system of inequalities.

y < –3x + 2

y ≥ –1

For y < –3x + 2, graph the

dashed boundary line
y = –3x + 2, and shade
below it.
For y ≥ –1, graph the solid
boundary line y = –1, and
shade above it.
YOU TRY!

Graph the system of inequalities.

x – 3y < 6
2x + y > 1.5
For x – 3y < 6, graph the dashed
1
boundary line y = x – 2, and
3
shade above it.
For 2x + y > 1.5, graph the
dashed boundary line
y = –2x + 1.5, and shade above it.
The overlapping region is the solution region.
YOU TRY!

Graph each system of inequalities.

y≤4

2x + y < 1

For y ≤ 4, graph the solid

boundary line y = 4, and
shade below it.
For 2x + y < 1, graph
the dashed boundary line
y = –3x +2, and shade
below it.
The overlapping region is the solution region.
Geometry Application
Graph the system of inequalities, and classify the figure created
by the solution region.
x ≥ –2
x ≤ 3
y ≥ –x + 1
y ≤ 4
Graph the solid boundary line x = –2 and shade
to the right of it. Graph the solid boundary line
x = 3, and shade to the left of it.

Graph the solid boundary line y = –x + 1, and

shade above it. Graph the solid boundary line
y = 4, and shade below it. The overlapping
region is the solution region.
YOU TRY!
Graph the system of inequalities, and classify the figure created by
the solution region.
y≤4
y ≥–1
y ≤ –x + 8
y ≤ 2x + 2
Graph the solid boundary line y = 4 and shade
to the below it. Graph the solid boundary line
y = –1, and shade to the above it.

Graph the solid boundary line y = –x + 8, and

shade below it. Graph the solid boundary line
y = 2x + 2, and shade below it. The overlapping
region is the solution region.
Exit Ticket
Solve the system of inequalities Solve the system of inequalities by
by graphing. graphing.
x ≤ –2 y ≤ 3x + 2
y>3 y > –x

A. B. A. B.

C. D. C. D.
 SYSTEM OF LINEAR INEQUALITIES
Go to your Google Classroom and look for
WARMUP (09132023). The warmup is in Google Form.
Make sure to submit your answers on time and don’t
forget to click TURN IN in Google Classroom.
OPTIMIZATION WITH LINEAR
PROGRAMMING
Mr. John Llenord C. Villanueva
MGT 208
CABEIHM (BatStateU-TNEU)
• Graph a set of given constraints for a linear programming problem.
• Use linear programming to find the maximum and minimum value
given the objective function.
• Solve real-world contexts involving optimization using linear
programming.

• How do you use optimization with linear programming in finding

the maximum and minimum value given the objective function?
• How do you model and solve real-world problems using systems of
linear inequalities as constraints and the objective function for
optimization?
 LINEAR PROGRAMMING
Linear programming is method of finding a maximum or minimum value
of a function that satisfies a given set of conditions called constraints. A constraint
is one of the inequalities in a linear programming problem. The solution to the set of
constraints can be graphed as a feasible region.

Maximize the objective function P = 25x + 30y under the following constraints.
x≥0 (x, y) 25x + 30y P($)
y ≥ 1.5 (0, 4) 25(0) + 30(4) 120
(0, 1.5) 25(0) + 30(1.5) 45
2.5x + 5y ≤ 20
(2, 3) 25(2) + 30(3) 140
3x + 2y ≤ 12
(3, 1.5) 25(3) + 30(1.5) 120
The maximum value occurs at the vertex (2, 3).
P = $ 140
 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 Step 1 Graph the inequalities.

y≤4 The polygon formed is a

x+y≥2 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.

← 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).
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) = 2x + 3y for this region.
–x + 2y ≤ 2 x – 2y ≤ 4 x + y ≥ –2
Graph the system of inequalities.
There are only two points of
intersection, (–2, 0) and (0, –2).

The minimum value is –6 at (0, –2). Although f(–2, 0) is

–4, it is not the maximum value since there are other
points that produce greater values. For example, f(2,1)
is 7 and f(3, 1) is 9. It appears that because the region
is unbounded, f(x, y) has no maximum value.

Answer: The vertices are at (–2, 0) and (0, –2).

There is no maximum value.
The minimum value is –6 at (0, –2).
You TRY!
Find the coordinates of the vertices Find the coordinates of the
of the figure formed by the system vertices of the figure formed by
of inequalities. the system of inequalities.
x≥0 y≤3
y≤0 y≥0
–3x + y = –6 x≥0
2y + 3x ≤ 12
A. (0, 0), (1, 0), (–3, 0) A. (0, 3), (0, 6), (2, 12)

B. (0, 0), (2, 0), (0, –6) B. (0, 0), (0, 3), (0, 6), (2, 3)

C. (0, 0), (–3, 0), (0, –6) C. (0, 0), (0, 3), (2, 3), (3, 2)

D. (0, 0), (2, 0), (–3, 0) D. (0, 0), (0, 3), (2, 3), (4, 0)
Graph the following system of inequalities. What are the maximum and
minimum values of the function f(x, y) = 4x – 3y for the feasible region of
the graph?

x≤4 y≤5 x+y≥6

A. maximum: f(4, 5) = 5
minimum: f(1, 5) = –11
B. maximum: f(4, 2) = 10
minimum: f(1, 5) = –11
C. maximum: f(4, 2) = 10
minimum: f(4, 5) = 5
D. maximum: f(1, 5) = –11
minimum: f(4, 2) = 10
Graph the following system of inequalities. What are the maximum and
minimum values of the function f(x, y) = x + 2y for the feasible region of
the graph?

x + 3y ≤ 6 –x – 3y ≤ 9 2y – x ≥ –6

A. maximum: no maximum
minimum: f(6, 0) = 6
B. maximum: f(6, 0) = 6
minimum: f(0, –3) = –6
C. maximum: f(6, 0) = 6
minimum: no minimum
D. maximum: no maximum
minimum: f(0, –3) = –6
 Linear Programming
Linear programming is a model that
consists of linear relationships
representing a firm’s decision(s), given an
objective and resource constraints. Linear
programming is used to find the
maximum and minimum values of some
types of functions when certain conditions
are placed on the variables. For instance,
we may want to minimize cost, maximize
profit, minimize calories or maximize
storage capacity. The maximum and v Nonnegativity constraints restrict the decision
variables to zero or positive values.
minimum values are also referred as
v Graphical solutions are limited to linear
extrema or optimum solution. The
programming problems with only two decision
process of finding the optimum solution in
variables. The graphical method provides a picture
a linear programming is called linear of how a solution is obtained for a linear
optimization. programming problem.
 A linear programming model consists of decision variables, an objective function,
and constraints. Parameters are numerical values that are included in the objective
functions and constraints. Decision variables are mathematical symbols that
represent levels of activity. The objective function is a linear relationship that
reflects the objective of an operation. A model constraint is a linear relationship
(usually system of linear inequalities) that represents a restriction on decision making.
Constraint lines are plotted as equations. If a problem involves constraints, which are
given by a set of linear inequalities, and 𝑓 𝑥, 𝑦 = 𝑎𝑥 + 𝑏𝑦 + 𝑐 is to be extremum
subject to the constraints, then the determination of the extremum and the point or
points where it occurs is called linear programming. The region S (also called as
feasible region) determined by the constraints is the solution space containing the set
of all possible points (feasible solutions) of linear programming that satisfy the
constraints is called the set of, and their linear function
Concept
Graphing a Feasible Region
Yum’s Bakery bakes two breads, A and B. One batch of A uses 5 pounds of
oats and 3 pounds of flour. One batch of B uses 2 pounds of oats and 3 pounds of
flour. The company has 180 pounds of oats and 135 pounds of flour available.
Write the constraints for the problem and graph the feasible region.
1 Let x = the number of bread A, and
3
y = the number of bread B.
2 Write the constraints:
x≥0 The number of batches cannot be
y≥0 negative.

5x + 2y ≤ 180 The combined amount of oats is less than

or equal to 180 pounds.
3x + 3y ≤ 135 The combined amount of flour is less than
or equal to 135 pounds.

4 Graph the feasible region. The feasible region is a quadrilateral with

vertices at (0, 0), (36, 0), (30, 15), and (0, 45).
 OPTIMIZATION
In most linear programming problems, you want to do more than
identify the feasible region. Often you want to find the best combination of
values in order to minimize or maximize a certain function. This function is the
objective function.
The objective function may have a minimum, a maximum, neither, or
both depending on the feasible region.

Yum’s Bakery wants to maximize its profits from bread sales. One batch
of A yields a profit of $40. One batch of B yields a profit of $30. Use the profit
information and the data from Example 1 to find how many batches of each
bread the bakery should bake.
5 Let P = the profit from the bread. Write the objective function:
P = 40x + 30y
x≥0
The feasible region is a quadrilateral with
y≥0 vertices at (0, 0), (36, 0), (30, 15), and (0, 45).

5x + 2y ≤ 180 6 Evaluate the objective function at the vertices of the feasible

region.
3x + 3y ≤ 135
(x, y) 40x + 30y P($)
(0, 0) 40(0) + 30(0) 0
(0, 45) 40(0) + 30(45) 1350 The maximum
value occurs at the
(30, 15) 40(30) + 30(15) 1650 vertex (30, 15).
(36, 0) 40(36) + 30(0) 1440

Yum’s Bakery should make 30 batches of bread A and

15 batches of bread B to maximize the amount of profit.
Do the following:
ü You TRY #s 3 – 7 on pp. 6-7
ü You TRY #s 2 – 3 on pp. 11-12
ü Supplementary Problems pp. 7-8
ü Supplementary Problems p. 13
NO WORK, NO CREDIT