# Linear Programming

## Maximize and minimize quantities using linear inequality systems

Estimated11 minsto complete
%
Progress
Practice Linear Programming

MEMORY METER
This indicates how strong in your memory this concept is
Progress
Estimated11 minsto complete
%
Linear Programming

Suppose a craftsman can make bracelets and necklaces. A bracelet requires 10 beads and takes 10 minutes to make, while a necklace requires 20 beads and takes 40 minutes to make. The craftsman has 1000 beads to work with, and he has 1600 minutes in which to work. If a bracelet costs $5 and a necklace costs$7.50, what is the maximum revenue that the craftsman can take in? How do you know?

### Linear Programming

This lesson moves on to the concept of systems of linear inequalities. Recall how to graph a linear inequality in two variables:

Step 1: Graph the equation using the most appropriate method.

• Slope-intercept form uses the intercept and slope to find the line.
• Standard form uses the intercepts to graph the line.
• Point-slope uses a point and the slope to graph the line.

Step 2: If the equal sign is not included draw a dashed line. Draw a solid line if the equal sign is included.

Step 3: Shade the half plane above the line if the inequality is “greater than.” Shade the half plane under the line if the inequality is “less than.”

In this Concept, we will learn how to graph two or more linear inequalities on the same coordinate plane. The inequalities are graphed separately on the same graph and the solution for the system of inequalities is the common shaded region between all the inequalities in the system.

The common shaded region of the system of inequalities is called the feasible region.

#### Let's solve the following system of inequalities:

.

The first equation is written in standard form and can be graphed using its intercepts. The line is solid because the equal sign is included in the inequality. Since the inequality is less than or equal to, shade the half plane below the line.

The second equation is a little tricky. Rewrite this in slope-intercept form to graph.

The division by –4 causes the inequality to reverse. The line is solid again because the equal sign is included in the inequality. Shade the half plane above the boundary line because is greater than or equal.

When we combine the graphs, we see that the blue and red shaded regions overlap. This overlap is where both inequalities work. Thus the purple region denotes the solution of the system, the feasible region.

The kind of solution displayed in the problem above is called unbounded, because it continues forever in at least one direction (in this case, forever upward and to the left).

Bounded regions occur when more than two inequalities are graphed on the same coordinate plane.

#### Writing Systems of Linear Inequalities

In some cases, you are given the feasible region and asked to write the system of inequalities. To do this, you work in reverse order of graphing.

• Write the equation for the boundary line.
• Determine whether the sign should include “or equal to.”
• Determine which half plane is shaded.
• Repeat for each boundary line in the feasible region.

#### Let's write the system of inequalities shown in the graph below:

There are two boundary lines, so there are two inequalities. Write each one in slope-intercept form.

#### Linear Programming – Real-World Systems of Linear Inequalities

Entire careers are devoted to using systems of inequalities to ensure a company is making the most profit by producing the right combination of items or is spending the least amount of money to make certain items. Linear programming is the mathematical process of analyzing a system of inequalities to make the best decisions given the constraints of the situation.

Constraints are the particular restrictions of a situation due to time, money, or materials.

The goal is to locate the feasible region of the system and use it to answer a profitability, or optimization, question.

There is an important theorem that is used in optimization problems: The maximum or minimum values of an optimization equation occur at the vertices of the feasible region – at the points where the boundary lines intersect.

This theorem tells us that while the individual colors of the inequalities will overlap, providing an infinite number of possible combinations, only the vertices will provide the maximum (or minimum) solutions to the optimization equation.

#### Let's solve the following problem using system of inequalities:

James is trying to expand his pastry business to include cupcakes and personal cakes. He has 40 hours available to decorate the new items and can use no more than 22 pounds of cake mix. Each personal cake requires 2 pounds of cake mix and 2 hours to decorate. Each cupcake order requires one pound of cake mix and 4 hours to decorate. If he can sell each personal cake for $14.99 and each cupcake order for$16.99, how many personal cakes and cupcake orders should James make to make the most revenue?

There are four inequalities in this situation. First, state the variables. Let the number of personal cakes and the number of cupcake orders.

Translate this into a system of inequalities.

– This is the amount of available cake mix.

– This is the available time to decorate.

– You cannot make negative personal cakes.

– You cannot make negative cupcake orders.

Now graph each inequality and determine the feasible region.

The feasible region has four vertices: {(0, 0),(0, 10),(11, 0),(8, 6)}. According to our theorem, the optimization answer will only occur at one of these vertices.

Write the optimization equation. How much of each type of order should James make to bring in the most revenue?

Substitute each ordered pair to determine which makes the most money.

To make the most revenue, James should make 8 personal cakes and 6 cupcake orders.

### Examples

#### Example 1

Earlier, you were told that a bracelet requires 10 beads and 10 minutes to make while a necklace requires 20 beads and takes 40 minutes to make. The craftsman has 1000 beads to work with and he has 1600 minutes in which to work. If a bracelet costs $5 and a necklace costs$7.50, what is the maximum revenue that the craftsman can take in?

There are four inequalities in this situation. Let  be the number of bracelets made and  be the number of necklaces made.

The system of inequalities for this situation is:

-This is the amount of available beads.

-This is the available time to make the jewelry.

-You cannot make negative bracelets.

-You cannot make negative necklaces.

Now, graph each inequality and determine the feasible region.

The feasible region has four vertices: {(0, 0), (0, 40), (40, 30), (100, 0)}. According to the theorem, the optimization will only occur at one of these vertices.

Now, write the optimization equation: .

Substitute each ordered pair to determine which makes the most money.

The craftsman can at most make $500 if he makes 100 bracelets. #### Example 2 Find the solution set to the following system. Graph each line and shade appropriately. Finally, we graph and , and the intersecting region is shown in the following figure. ### Review 1. What is linear programming? 2. What is the feasible region of a system of inequalities? 3. How do constraints affect the feasible region? 4. What is an optimization equation? What is its purpose? 5. You have graphed a feasible region. Where are the maximum (or minimum) points of the optimization equation located? Find the solution region of the following systems of inequalities. Write the system of inequalities for each feasible region pictured below. Given the following constraints, find the maximum and minimum values for: 1. Find the maximum and minimum value of given the constraints. 2. In Andrew’s Furniture Shop, he assembles both bookcases and TV cabinets. Each type of furniture takes him about the same time to assemble. He figures he has time to make at most 18 pieces of furniture by this Saturday. The materials for each bookcase cost him$20.00 and the materials for each TV stand cost him $45.00. He has$600.00 to spend on materials. Andrew makes a profit of $60.00 on each bookcase and a profit of$100.00 for each TV stand. Find how many of each piece of furniture Andrew should make so that he maximizes his profit.
3. You have $10,000 to invest, and three different funds from which to choose. The municipal bond fund has a 5% return, the local bank's CDs have a 7% return, and a high-risk account has an expected 10% return. To minimize risk, you decide not to invest any more than$1,000 in the high-risk account. For tax reasons, you need to invest at least three times as much in the municipal bonds as in the bank CDs. Assuming the year-end yields are as expected, what are the optimal investment amounts?

Mixed Review

1. Solve by elimination: .
2. Solve .
3. Determine the intercepts of .
4. Jerry’s aunt repairs upholstery. For three hours' worth of work, she charges $145. For nine hours of work, she charges$355. Assuming this relationship is linear, write the equation for this line in point-slope form. How much would Jerry’s aunt charge for 1.25 hours worth of work?
5. Translate into an algebraic sentence: “Yoder is four years younger than Kate. Kate is six years younger than Dylan. Dylan is 20.” How old is each person?

### Notes/Highlights Having trouble? Report an issue.

Color Highlighted Text Notes

### Vocabulary Language: English Spanish

TermDefinition
Constraint A constraint is a limitation.
Feasible region The feasible region is the inner region within a set of four inequalities on a graph.
Linear Programming Linear programming uses the vertices of the feasible region (the area of overlap between multiple inequalities) to determine a maximum or minimum value.
solution for the system of inequalities The common shaded region between all the inequalities in the system.
theorem The maximum or minimum values of an optimization equation occur at the vertices of the feasible region – at the points where the boundary lines intersect.