5.7: Real-World Applications of Systems of Inequalities
The Vertex Theorem for Feasible Regions
Introduction
In this lesson you will learn about the vertex theorem for feasible regions and how to apply this theorem to real-world problems. You will learn to write a system of linear inequalities to model the real-world problem. This system will then be graphed to determine the solution set for the system of inequalities. Using the vertex theorem, you will then answer the real-world problem.
Objectives
The lesson objectives for the Vertex Theorem for Feasible Regions are:
- Understanding the vertex theorem.
- Writing a system of inequalities for a real-world problem.
- Solving the system of inequalities by graphing
- Determining the vertices algebraically by solving the linear inequalities.
- Using the vertex theorem to determine the answer to the real-world problem.
Introduction
A system of linear inequalities is often used to determine the best solution to a problem. This solution could be as simple as determining how many of a product should be produced to maximize a profit or as complicated as determining the correct combination of drugs to give a patient. Regardless of the problem, there is a theorem in mathematics that is used, with a system of linear inequalities, to determine the best solution to the problem.
Guidance
The following diagram shows a feasible region that is within a polygonal region.
The linear function will now be evaluated for each of the vertices of the polygon.
To evaluate the value of ‘’ substitute the coordinates of the point into the expression for ‘’ and ‘’.
The value of , for each of the vertices, remains constant along any line with a slope of . This is obvious on the following graph.
As the line moved away from the origin, the value of increased. The maximum value for the shaded region occurred at the vertex (9, 4) while the minimum value occurred at the vertex (0, 0). These statements confirm the vertex theorem for a feasible region:
If a linear expression is to be evaluated for all points of a convex, polygonal region, then the maximum value of , if one exists, will occur at one of the vertices of the feasible region. Also, the minimum value of , if one exists, will occur at one of the vertices of the feasible region.
Example A
Evaluate the expression for the given feasible region, to determine the point at which ‘’ has a maximum value and the point at which ‘’ has a minimum value.
The maximum value of ‘’ occurred at the vertex (6, 3).
The minimum value of ‘’ occurred at the vertex (-4, 0).
Using the vertices of the feasible region to determine the maximum or the minimum value is the branch of mathematics known as linear programming. Linear programming is a technique used by business to solve problems. The types of problems that usually employ linear programming are those where the profit is to be maximized and those where the expenses are to be minimized. However, linear programming can also be used to solve other types of problems. The solution provides the business with a program to follow to obtain the best results for the company. The following examples will demonstrate different types of real-world problems which use linear programming to obtain the solution.
Example B
A company that produces flags makes two flags for Nova Scotia-the traditional blue flag and the green flag for Cape Breton. To produce each flag, two types of material, nylon and cotton, are used. The company has 450 units of nylon in stock and 300 units of cotton. The traditional blue flag requires 6 units of nylon and 3 units of cotton. The Cape Breton flag requires 5 units of nylon and 3 units of cotton.
Each blue flag that is made realizes a profit of $12 for the company, whereas each Cape Breton flag realizes a profit of $15. For the nylon and cotton that the company currently has in stock, how many of each flag should the company make to maximize their profit?
Let ‘’ represent the number of blue flags.
Let ‘’ represent the number of green flags.
Step 1:
Transfer the information presented in the problem to a table.
Units Required per Blue Flag | Units Required Per Green Flag | Units Available | |
---|---|---|---|
Nylon | 6 | 5 | 450 |
Cotton | 3 | 5 | 300 |
Profit(per flag) | $12 | $15 |
The information presented in the problem identifies the restrictions or conditions on the production of the flags. These restrictions are known as constraints and are written as inequalities to represent the information presented in the problem.
Step 2:
From the information (now in the table), list the constraints.
The number of blue flags that are produced must be either zero or greater than zero. Therefore, the constraint is .
The number of green flags that are produced must be either zero or greater than zero. Therefore, the constraint is .
The total number of units of nylon required to make both types of flags cannot exceed 450. Therefore, the constraint is .
The total number of units of cotton required to make both types of flags cannot exceed 300. Therefore, the constraint is .
Step 3:
Write an equation to identify the profit.
Step 4:
Graph the listed constraints to identify the feasible region.
The feasible region is the area shaded in teal blue.
Step 5:
Algebraically, determine the exact point of intersection between the constraints. Also, the intercept of the feasible region must be calculated.
Write the constraints as linear equations and solve the system by elimination.
The intercept for the inequality must be calculated.
Write the inequality as a linear equation. Set ‘’ equal to zero and solve the equation for ‘’.
The intercept of the feasible region is (75, 0).
The intercept is (0, 60). This point was plotted when the inequalities were put into slope-intercept form for graphing.
The following graph shows the vertices of the polygon than encloses the feasible region.
Step 6:
Calculate the profit, using the profit equation, for each vertex of the feasible region:
The maximum profit occurred at the vertex (50, 30). This means, with the supplies in stock, the company should make 50 blue flags and 30 green flags to maximize their profit.
Example C
A local smelting company is able to provide its customers with iron, lead and copper by melting down either of two ores, A or B. The ores arrive at the company in railroad cars. Each railroad car of ore A contains 3 tons of iron, 3 tons of lead and I ton of copper. Each railroad car of ore B contains 1 ton of iron, 4 tons of lead and 3 tons of copper. The smelting receives an order for 7 tons of iron, 19 tons of lead and 8 tons of copper. The cost to purchase and process a carload of ore A is $7000 while the cost for ore B is $6000. If the company wants to fill the order at a minimum cost, how many carloads of each ore must be bought?
Let ‘’ represent the number of carloads of ore A to purchase.
Let ‘’ represent the number of carloads of ore B to purchase.
Step 1:
Transfer the information presented in the problem to a table.
One Carload of ore A | One Carload of ore B | Number of tons to fill the order | |
---|---|---|---|
Tons of Iron | 3 | 1 | 7 |
Tons of Lead | 3 | 4 | 19 |
Tons of Copper | 1 | 3 | 8 |
Step 2:
From the information, list the constraints.
The number of carloads of ore A that must be bought is either zero or greater than zero. Therefore, the constraint is .
The number of carloads of ore B that must be bought is either zero or greater than zero. Therefore, the constraint is .
The total number of tons of iron from ore A and ore B must be greater than or equal to the 7 tons needed to fill the order. Therefore, the constraint is .
The total number of tons of lead from ore A and ore B must be greater than or equal to the 20 tons needed to fill the order. Therefore, the constraint is .
The total number of tons of copper from ore A and ore B must be greater than or equal to the 8 tons needed to fill the order. Therefore, the constraint is .
Step 3:
Write an equation to represent the cost in dollars of carloads of ore A and y carloads of ore B.
Step 4:
Graph the listed constraints to identify the feasible region.
The feasible region shows that there are an infinite number of ways to fill the order. The feasible region is the large shaded that is sitting above the graphed lines.
Step 5:
Algebraically, determine the exact point of intersection between the constraints. Also, the intercept of the feasible region must be calculated.
Write the constraints as linear equations and solve the system by elimination.
The intercept for the inequality must be calculated.
Write the inequality as a linear equation. Set ‘’ equal to zero and solve the equation for ‘’.
The intercept of the feasible region is (8, 0).
The intercept is (0, 7). This point was plotted when the inequalities were put into slope-intercept form for graphing.
The following graph shows the vertices of the region borders the feasible region.
Step 6:
Calculate the cost, using the cost equation, for each vertex of the feasible region:
The minimum cost is located at the vertex (1, 4). Therefore the company should buy one carload of ore A and four carloads of ore B.
Vocabulary
- Constraint
- A constraint is a restriction or condition presented in a real-world problem. The constraints are written as inequalities and are used to solve the problem.
- Linear Programming
- Linear programming is a branch of mathematics that uses systems of linear inequalities to solve real-world problems. The vertex theorem of regions is applied to the vertices to determine the best solution to the problem.
- Vertex Theorem for Regions
- The vertex theorem for regions states:
- If a linear expression is to be evaluated for all points of a convex, polygonal region, then the maximum value of , if one exists, will occur at one of the vertices of the feasible region. Also, the minimum value of , if one exists, will occur at one of the vertices of the feasible region.
Guided Practice
1. For the following graphed region and the expression , find a point where ‘’ has a maximum value and a point where ‘’ has a minimum value.
2. The following table shows the time required on three machines for a company to produce Super 1 and Super 2 coffee percolators. The table also shows the amount of time that each machine is available during a one hour period. The company is trying to determine how many of each must be made to maximize a profit if they make $30 on each Super 1 model and $35 on each Super 2 model. List the constraints and write a profit statement to represent the information.
Super 1 | Super 2 | Time Available | |
---|---|---|---|
Machine A | 1 minute | 3minutes | 24 minutes |
Machine B | 3 minutes | 2minutes | 36 minutes |
Machine C | 3 minutes | 4 minutes | 44 minutes |
3. A local paint company has created two new paint colors. The company has 28 units of yellow tint and 22 units of red tint and intends to mix as many quarts as possible of color X and color Y. Each quart of color X requires 4 units of yellow tint and 1 unit of red tint. Each quart of color Y requires 1 unit of yellow tint and 4 units of red tint. How many quarts of each color can be mixed with the units of tint that the company has available? List the constraints, complete the graph and determine the solution using linear programming.
Answers
1. The vertices of the polygonal region are (-7, -1); (2, 5); (6, 1); and (0, -4).
The maximum value of ‘’ occurred at the vertex (2, 5).
The minimum value of ‘’ occurred at the vertex (-7, -1).
2. Let ‘’ represent the number of Super 1 coffee percolators.
Let ‘’ represent the number of Super 2 coffee percolators.
The number of Super 1 coffee percolators that are made must be either zero or greater than zero. Therefore, the constraint is .
The number of Super 2 coffee percolators that are made must be either zero or greater than zero. Therefore, the constraint is .
The total amount of time that both a Super1 and a Super 2 model can be processed on Machine A is less than or equal to 24 minutes. Therefore, the constraint is .
The total amount of time that both a Super1 and a Super 2 model can be processed on Machine B is less than or equal to 36 minutes. Therefore, the constraint is .
The total amount of time that both a Super1 and a Super 2 model can be processed on Machine C is less than or equal to 44 minutes. Therefore, the constraint is .
The profit equation is
3. Table:
Color X | Color Y | Units Available | |
---|---|---|---|
Yellow Tint | 4 units | 1 unit | 28 |
Red Tint | 1 unit | 4 units | 22 |
Constraints:
Let ‘’ represent the number of quarts of Color X paint to be made.
Let ‘’ represent the number of quarts of Color Y paint to be made.
The number of quarts of Color X paint that are mixed must be either zero or greater than zero. Therefore, the constraint is .
The number of quarts of Color Y paint that are mixed must be either zero or greater than zero. Therefore, the constraint is .
The total amount of yellow tint that is used to mix Color X and Color Y must be less than or equal to 28. Therefore, the constraint is .
The total amount of red tint that is used to mix Color X and Color Y must be less than or equal to 22. Therefore, the constraint is .
Graph:
Vertices:
The company wants to mix as many quarts as possible of Color X and of Color Y paint. Therefore, the and intercepts have no meaning in this problem.
The company should mix 7 quarts of Color X paint and 4 quarts of Color Y paint.
Summary
In this lesson you have learned that a system of linear inequalities can be used to solve real- world problems. The solution to the problem is determined by graphing the system and using the vertices of the feasible region to calculate the best answer. The vertices were used since the Vertex Theorem for regions states that the maximum and minimum values, if they exist, occur at a vertex.
To ensure that the vertices were accurate, the inequalities of the intersecting lines were solved algebraically. The method that is used to solve the system of inequalities is a personal choice. Regardless of the method used, the results will not differ. In many problems it was also necessary to determine the and intercepts for the feasible region.
Problem Set
For each graphed region and corresponding equation, find a point at which ‘’ has a maximum value and a point at which ‘’ has a minimum value.
For each of the following problems, list the constraints, complete the graph and determine the maximum profit. Show all of your work.
- A small manufacturing company makes $125 on each DVD player it produces and $100 profit on each color TV set it makes. Each DVD player and each TV must be processed by a cutting machine (A), a fitting machine (B) and a polishing machine (C). Each DVD player must be processed on Machine A for one hour, on Machine B for one hour and on Machine C for four hours. Each TV set must be processed on Machine A for two hours, on Machine B for one hour and on Machine C for one hour. Machines A, B, and C are available for 16, 9, and 24 hours per day respectively. How many DVD players and TV sets must be made each day to maximize the profit?
- April has a small business during the winter months making hats and scarves. A hat requires 2 hours on Machine A, 4 hours on Machine B and 2 hours on Machine C. A scarf requires 3 hours on Machine A, 3 hours on Machine B and 1 hour on Machine C. Machine A is available 36 hours each week, Machine B is available 42 hours each week and Machine C is available 20 hours each week. The profit on a hat is $7.00 and the profit on a scarf is $4.00. How many of each should be made each week to maximize the profit?
- Beth is knitting mittens and gloves. Each pair must be processed on three machines. Each pair of mittens requires 2 hours on Machine A, 2 hours on Machine B and 4 hours on Machine C. Each pair of gloves requires 4 hours on Machine A, 2 hours on Machine B and 1 hour on Machine C. Machine A, B, and C are available 32, 18 and 24 minutes each day respectively. The profit on a pair of mittens is $8.00 and on a pair of gloves is $10.00. How many pairs of each should be made each day to maximize the profit?
- A patient is prescribed a pill that contains vitamins A, B and C. These vitamins are available in two different brands of pills. The first type is called Brand X and the second type is called Brand Y. The following table shows the amount of each vitamin that a Brand X and a Brand Y pill contain. The table also shows the minimum daily requirement needed by the patient. Each Brand X pill costs 32¢ and each Brand Y pill costs 29¢. How many pills of each brand should the patient take each day to minimize the cost?
Brand X | Brand Y | Minimum Daily Requirement | |
---|---|---|---|
Vitamin A | 2mg | 1mg | 5mg |
Vitamin B | 3mg | 3mg | 12mg |
Vitamin C | 25mg | 50mg | 125mg |
- A local smelting company is able to provide its customers with lead, copper and iron by melting down either of two ores, X or Y. The ores arrive at the company in railroad cars. Each railroad car of ore X contains 5 tons of lead, 1 ton of copper and I ton of iron. Each railroad car of ore Y contains 1 ton of lead, 1 ton of copper and 1 ton of iron. The smelting receives an order for 20 tons of lead, 12 tons of copper and 20 tons of iron. The cost to purchase and process a carload of ore X is $6000 while the cost for ore Y is $5000. If the company wants to fill the order at a minimum cost, how many carloads of each ore must be bought?
Answers
- The vertices of the polygonal region are (0, 0); (0, 5); (6, 7); (7, 4) and (6, 0).
The maximum value of ‘’ occurred at the vertex (6, 0).
The minimum value of ‘’ occurred at the vertex (0, 5).
- The vertices of the polygonal region are (-3, 2); (5, 4) and (1, -5).
The maximum value of ‘’ occurred at the vertex (1, -5).
The minimum value of ‘’ occurred at the vertex (-3, 2).
- The vertices of the polygonal region are (-7, 0); (-5, 5); (0, 0); (3, 4); (6, 0) and (0, -5).
The maximum value of ‘’ occurred at the vertex (6, 0).
The minimum value of ‘’ occurred at the vertex (-5, 5).
- 1. Let ‘’ represent the number of DVDs to be made. Let ‘’ represent the number of TVs to be made.
Table:
DVD | TV | Time Available hr/ day | |
---|---|---|---|
Machine A | 1hr | 2hr | 16 |
Machine B | 1hr | 1hr | 9 |
Machine C | 4hr | 1hr | 24 |
Constraints:
Profit equation:
Graph:
The feasible region is the area shaded in yellow.
Vertices:
The intercept of is (0, 8).
The intercept of is (6, 0)
The vertices of the feasible region are (0, 0); (0, 8); (2, 7); (5, 4) and (6, 0).
Profit:
To maximize their profit, the company should make five DVDs and 4 TVs each day.
- Let ‘’ represent the number of Brand X pills to be used. Let ‘’ represent the number of Brand Y pills to be used.
Table:
Brand X | Brand Y | Minimum Daily Requirement | |
---|---|---|---|
Vitamin A | 2mg | 1mg | 5mg |
Vitamin B | 3mg | 3mg | 12mg |
Vitamin C | 25mg | 50mg | 125mg |
Constraints:
Cost equation:
Graph:
The feasible region is the area shaded in pink.
Vertices:
The intercept of is (5, 0)
The intercept of is (0, 5)
The vertices of the feasible region are (0, 5); (1, 3); (3, 1) and (5, 0).
Cost:
To minimize the cost of the pills, the patient should take one Brand X pill and three Brand Y pills daily.