8.5 Linear Programming

The term linear programming was coined in the late 1940s. It describes a relatively young branch of mathematics, compared to subjects such as Euclidean geometry, where the major ideas were already well understood 23 centuries ago. (The Greek mathematician Euclid wrote what can be considered the first geometry textbook about 300 B.C.) Business managers routinely solve linear programming problems for purchasing and marketing strategy, so it is possible that linear programming affects your daily life as much as any other branch of mathematics.

The Objective Function and Constraints

TrailGear would like to maximize its profit from selling hiking boots. The company produces two kinds of hiking boots, a Weekender model, on which it makes $ $8$ profit per pair, and a Sierra model, on which it makes $ $10$ profit per pair. How many of each model should TrailGear produce each week in order to maximize its profit?

If we let $x$ represent the number of Weekender boots and $y$ the number of Sierra boots TrailGear produces, then the total weekly profit is given by

$P = 8 x + 10 y$

This expression for $P$ is called the objective function. The goal of a linear programming problem is to maximize or minimize such an objective function, subject to one or more constraints.

If TrailGear had infinite resources and an infinite market, there would be no limit to the profit it could earn by producing more and more hiking boots. However, every business has to consider many factors, including its supplies of labor and materials, overhead and shipping costs, and the size of the market for its product. To keep things simple, we will concentrate on just two of these factors.

Each pair of Weekender boots requires $3$ hours of labor to produce, and each pair of Sierra boots requires $6$ hours. TrailGear has available $2400$ hours of labor per week. Thus, $x$ and $y$ must satisfy the inequality

$3 x plus 6 y less than or equal to 2400$

In addition, suppose that TrailGear's suppliers can provide at most $1000$ ounces of silicone gel each week, with each pair of Weekenders using $2$ ounces and each Sierra model using $1$ ounce. This means that

$2 x plus y less than or equal to 1000$

Of course, we will also require that $x greater than or equal to 0$ and $y greater than or equal to 0$ . These four inequalities are called the constraints of the problem.

Which of these could be an objective function?

_____

$M = 2 x + 5 y$

Which of these could be an objective function?

$2 x plus 5 y less than or equal to 50$
$M = 2 x + 5 y$
$y greater than or equal to 2 x plus 50$
$2 x + 5 y = 50$

Feasible Solutions

We have formulated the original problem into an objective function

$P = 8 x + 10 y$

and a system of inequalities called the constraints.

$\begin{aligned} 3 x + 6 y & \leq 2400 \\ 2 x + y & \leq 1000 \\ x \geq 0, & y \geq 0 \end{aligned}$

Our goal is to find values for $x$ and $y$ that satisfy the constraints and produce the maximum value for $P$ . We begin by graphing the solutions to the constraint inequalities. These solutions are shown in the shaded region in at right. The points in this region are called feasible solutions because they are the only values we can consider while looking for the maximum value of the objective function $P$ .

system of inequalities defining feasible solutions

Example 1

Verify that the points $open parenthesis 300, 100 close parenthesis$ and $open parenthesis 200, 300 close parenthesis$ represent feasible solutions for the problem above. Show that $open parenthesis 300, 400 close parenthesis$ is not a feasible solution.
Find the values of the objective function $P = 8 x + 10 y$ at the two feasible solutions in part (a).

The two points $open parenthesis 300, 100 close parenthesis$ and $open parenthesis 200, 300 close parenthesis$ lie within the shaded region above, but $open parenthesis 300, 400 close parenthesis$ does not. We can also verify that the coordinates of $open parenthesis 300, 100 close parenthesis$ and $open parenthesis 200, 300 close parenthesis$ satisfy each of the constraint inequalities.
For $open parenthesis 300, 100 close parenthesis$ , we have
$P = 8 (300) + 10 (100) = 3400$
For $open parenthesis 200, 300 close parenthesis$ , we have
$P = 8 (200) + 10 (300) = 4600$

What is the set of feasible solutions?

_____

The set of points that satisfy the constraints is the set of feasible solutions.

What is the set of feasible solutions?

The vertices of the solution set
The values of the objective function
The set of points that satisfy the constraints
The boundary lines of the inequalities

Determine which of the points $open parenthesis 0, 400 close parenthesis$ , $open parenthesis 400, 200 close parenthesis$ , $open parenthesis 500, 0 close parenthesis$ , and $open parenthesis 500, 400 close parenthesis$ represent feasible solutions for the TrailGear problem.
_____ Separate different ordered pairs with a comma.
Find the values of the objective function $P = 8 x + 10 y$ at the feasible solutions in part (a).
At $open parenthesis 0, 400 close parenthesis, P equals$ _____
At $open parenthesis 400, 200 close parenthesis, P equals$ _____
At $open parenthesis 500, 0 close parenthesis, P equals$ _____

$open parenthesis 0, 400 close parenthesis$ , $open parenthesis 400, 200 close parenthesis$ , and $open parenthesis 500, 0 close parenthesis$
At $open parenthesis 0, 400 close parenthesis$ , $P equals 4000$ ; at $open parenthesis 400, 200 close parenthesis$ , $P equals 5200$ ; at $open parenthesis 500, 0 close parenthesis$ , $P equals 4000$

Determine which of the points $open parenthesis 0, 400 close parenthesis$ , $open parenthesis 400, 200 close parenthesis$ , $open parenthesis 500, 0 close parenthesis$ , and $open parenthesis 500, 400 close parenthesis$ represent feasible solutions for the TrailGear problem.
Find the values of the objective function $P = 8 x + 10 y$ at the feasible solutions in part (a).

$open parenthesis 0, 400 close parenthesis$ , $open parenthesis 400, 200 close parenthesis$ , and $open parenthesis 500, 0 close parenthesis$
At $open parenthesis 0, 400 close parenthesis$ , $P equals 4000$ ; at $open parenthesis 400, 200 close parenthesis$ , $P equals 5200$ ; at $open parenthesis 500, 0 close parenthesis$ , $P equals 4000$

Explain how to find the set of feasible solutions.

_____

Explain how to find the set of feasible solutions.

The Optimum Solutions

We cannot check all of the feasible solutions to see which one results in the largest profit. Fortunately, there is a simple way to find the optimal solution.

Consider the objective function,

$P = 8 x + 10 y$

Suppose TrailGear would like to make $$ 2000$ on hiking. It could produce $200$ pairs of Sierra boots, or $250$ pairs of Weekenders. Or it could produce some of each; for example, $50$ pairs of Weekenders and $160$ pairs of Sierra boots. In fact, every point on the line

$8 x + 10 y = 2000$

represents a combination of Weekenders and Sierra boots that will yield a profit of $ $2000$ . This line is labeled $P equals 2000$ in the figure below.

lines of constant objective function drawn over feasible solutions

If TrailGear would like to make $ $4000$ on boots, it should choose a point on the line labeled $P equals 4000$ . Similarly, all the points on the line labeled $P equals 6000$ will yield a profit of $ $6000$ , and so on. Different values of $P$ correspond to parallel lines on the graph. Smaller values of $P$ correspond to lines near the origin, and larger values of $P$ have lines farther from the origin.

What is an optimal solution?

_____

The largest or smallest value of the objective function in the set of feasible solutions

What is an optimal solution?

The largest or smallest feasible solution
The largest or smallest value of the objective function in the set of feasible solutions
The vertex farthest from the origin
The largest or smallest constrained $y$ -value

Example 2

The figure below shows the feasible solutions for another linear programming problem. The objective function is $C = 3 x + 5 y$ .

Find the value of $C$ at the point $open parenthesis 0, 3 close parenthesis$ . Are there other feasible solutions that give the same value of $C$ ?
Find all feasible solutions that result in an objective value of $30$ .
How many feasible solutions result in an objective value of $39$ ?
Is it possible for a feasible solution to result in an objective value of 45?

The objective value at the point $open parenthesis 0, 3 close parenthesis$ is
$C = 3 (0) + 5 (3) = 15$
Another point with the same objective value is $open parenthesis 5, 0 close parenthesis$ . In fact, all points on the line $3 x + 5 y = 15$ have an objective value of $15$ . This line intersects the set of feasible solutions in a line segment, as shown in below. Thus, there are infinitely many feasible solutions with objective value $15$ .
Points that give an objective value of $C equals 30$ lie on the line $3 x + 5 y = 30$ , as shown in the figure. There are infinitely many feasible solutions that lie on this line; for example, one such point is $open parenthesis 5, 3 close parenthesis$ .
The line $3 x + 5 y = 39$ intersects the set of feasible solutions in only one point, the point $open parenthesis 3, 6 close parenthesis$ . This is the only feasible solution that yields an objective value of $39$ .
The line $3 x + 5 y = 45$ includes all points for which $C equals 45$ . This line does not intersect the set of feasible solutions, as we see in the figure. Thus, there are no feasible solutions that result in an objective value of $45$ .

Returning to this section's opening Example regarding TrailGear profits for selling hiking boots, find all feasible solutions for which the objective function $P = 8 x + 10 y$ has a value of $5200$ .
_____
Find all feasible solutions that result in an objective value of $6000$ .
_____

$open parenthesis 400, 200 close parenthesis$
None

Returning to this section's opening Example regarding TrailGear profits for selling hiking boots, find all feasible solutions for which the objective function $P = 8 x + 10 y$ has a value of $5200$ .
Find all feasible solutions that result in an objective value of $6000$ .

$open parenthesis 400, 200 close parenthesis$
None

We are only allowed to choose points from the set of feasible solutions. Imagine the parallel lines representing different values of the objective function sweeping across the graph of the feasible solutions. The objective values increase as the lines sweep up across the graph.

What is the last feasible solution the lines intersect before leaving the shaded region? If you study the preceding examples, perhaps you can see that the largest (and smallest) values of the objective function will occur at corner points of the set of feasible solutions. We have not proved this fact, but it is true.

Depending on the exact formula for the objective function, the maximum and minimum values may occur at any of the vertices of the shaded region.

system of inequalities defining the feasible solutions

The figure above shows the feasible solutions for a linear programming problem. The objective function is $R = x + 5 y$ .

Sketch lines for objective values of $R equals 5$ , $R equals 15$ , $R equals 25$ , and $R equals 35$ .
Evaluate the objective function at each vertex of the shaded region.
At $open parenthesis 2, 1 close parenthesis, P equals$ _____
At $open parenthesis 0, 5 close parenthesis, P equals$ _____
At $open parenthesis 7, 2 close parenthesis, P equals$ _____
Which vertex corresponds to the maximum value of the objective function? _____
What is the maximum value? _____
Which vertex corresponds to the minimum value of the objective function? _____
What is the minimum value? _____

A graph is below.
At $open parenthesis 2, 1 close parenthesis$ , $R equals 7$ ; at $open parenthesis 0, 5 close parenthesis$ , $R equals 25$ ; at $open parenthesis 7, 2 close parenthesis$ , $R equals 17$
The maximum value of $R$ occurs at $open parenthesis 0, 5 close parenthesis$ . The maximum value is $25$ .
The minimum value of $R$ occurs at $open parenthesis 2, 1 close parenthesis$ . The minimum value is $7$ .

Graph for part (a):

feasible solutions and objective function lines

The figure below shows the feasible solutions for a linear programming problem. The objective function is $R = x + 5 y$ .

Sketch lines for objective values of $R equals 5$ , $R equals 15$ , $R equals 25$ , and $R equals 35$ .
Evaluate the objective function at each vertex of the shaded region.
Which vertex corresponds to the maximum value of the objective function? What is the maximum value?
Which vertex corresponds to the minimum value of the objective function? What is the minimum value?

At $open parenthesis 2, 1 close parenthesis$ , $R equals 7$ ; at $open parenthesis 0, 5 close parenthesis$ , $R equals 25$ ; at $open parenthesis 7, 2 close parenthesis$ , $R equals 17$
The maximum value of $R$ occurs at $open parenthesis 0, 5 close parenthesis$ . The maximum value is $25$ .
The minimum value of $R$ occurs at $open parenthesis 2, 1 close parenthesis$ . The minimum value is $7$ .

We can now formulate a strategy for solving problems by linear programming.

Linear programming is used to

_____

find an optimal solution subject to a set of constraints.

Linear programming is used to

find the vertices of a region.
solve a system of inequalities.
write a set of inequalities in two variables.
find an optimal solution subject to a set of constraints.

In Example, the set of feasible solutions is an unbounded region.

Example 4

Each week, the Healthy Food Store buys both granola and muesli in bulk from two cereal companies. The store requires at least $12$ kilograms of granola and $9$ kilograms of muesli.

Company A charges $ $15$ for a package that contains $2$ kilograms of granola and $1$ kilogram of muesli.
Company B charges $ $25$ for a package of $3$ kilograms of granola and $3$ kilograms of muesli.

How much should the Healthy Food Store purchase from each company in order to minimize its costs and still meet its needs for granola and muesli? What is the minimum cost?

$\begin{matrix} Number of packages purchased from Company A: x \\ Number of packages purchased from Company B: y \end{matrix}$
First, we write the objective function. The store would like to minimize its cost, so
$C = 15 x + 25 y$
Next, we write the constraints. These will be a system of inequalities. It may help to organize the information into a table.
Company A Company B Required
Granola $2 x$ $3 y$ 12
Muesli $x$ $3 y$ 9

The Healthy Food Store will have $2 x$ kilograms of granola and $x$ kilograms of muesli from Company A, and $3 y$ kilograms of granola and $3 y$ kilograms of muesli from Company B. The store requires that
$\begin{aligned} 2 x + 3 y & \geq 12 \\ x + 3 y & \geq 9 \end{aligned}$
Because the store cannot purchase negative quantities, we also have
$x greater than or equal to 0, y greater than or equal to 0$
We graph the solutions to the constraint system. The feasible solutions form the shaded region shown below. Any ordered point on this graph corresponds to a way to purchase granola and muesli that meets the store’s needs, but some of these choices cost more than others.
We know that the minimum cost will occur at one of the vertex points, which are labeled in the figure. The coordinates of $P$ and $R$ are easy to see. To find the coordinates of $Q$ , we notice that it is the intersection of the lines $2 x + 3 y = 12$ and $x + 3 y = 9$ . Thus, we must solve the system
$\begin{aligned} 2 x + 3 y & = 12 \\ x + 3 y & = 9 \end{aligned}$
Subtracting the second equation from the first, we find that $x equals 3$ . Substituting this value into either of the original two equations, we find that $y equals 2$ . Thus the point $Q$ has coordinates $open parenthesis 3, 2 close parenthesis$ .
Now we evaluate the objective function at each of the three vertices.
$\begin{aligned} At P (0, 4) : & C & = 15 (0) + 25 (4) = 100 \\ At P (3, 2) : & C & = 15 (3) + 25 (2) = 95 & Minimum cost \\ At P (9, 0) : & C & = 15 (9) + 25 (0) = 135 \end{aligned}$
The minimum cost occurs at point $Q$ .
The Healthy Food Store should buy three packages from Company A and two packages from Company B. It will pay $ $95$ for its stock of granola and muesli.

Find the maximum value of the objective function, $O = 5 x + 3 y$ , subject to the constraints

$\begin{aligned} x + y & \geq 7 \\ 5 x + 2 y & \geq 20 \\ x \geq 0, y & \geq 0 \end{aligned}$

Answer: _____

The maximum value is $25$ (which occurs at the vertex $open parenthesis 2, 5 close parenthesis$ ).

Find the maximum value of the objective function, $O = 5 x + 3 y$ , subject to the constraints

$\begin{aligned} x + y & \geq 7 \\ 5 x + 2 y & \geq 20 \\ x \geq 0, y & \geq 0 \end{aligned}$

The maximum value is $25$ (which occurs at the vertex $open parenthesis 2, 5 close parenthesis$ ).

What fact helps us find the optimal solution?

_____

What fact helps us find the optimal solution?

Technology

Using a Graphing Calculator

You can use your graphing calculator to solve the problem in Example. Set the window values at

$\begin{aligned} Xmin & = 0 & Xmax = 9.4 \\ Ymin & = 0 & Ymax = 6.2 \end{aligned}$

Next, graph the set of feasible solutions. We have already taken care of the constraints $x greater than or equal to 0$ and $y greater than or equal to 0$ by setting Xmin and Ymin to zero. Solve each of the other constraints for $y$ to get

$\begin{aligned} y & \geq (12 - 2 x) / 3 \\ y & \geq (9 - x) / 3 \end{aligned}$

For each constraint, the set of feasible solutions lies above the boundary line, because $y$ is greater than the expression in $x$ . To shade the regions above the graphs of $Y sub 1$ and $Y sub 2$ , move the cursor onto the backslash in front of the equations and press ENTER twice, as shown in figure (a). Then press GRAPH. Your display should look like figure (b).

The feasible solutions lie in the crosshatched region that is shaded with both the vertical and horizontal lines. We will use the calculator to evaluate the objective function at each vertex. First, use the TRACE (or value or intersect feature) to find the coordinates of one of the vertices, say $open parenthesis 0, 4 close parenthesis$ . Then press 2nd QUIT to get back to the Home screen; enter the formula for the objective function by keying in

$15 X plus 25 Y$

(Enter $Y$ by pressing ALPHA $1$ .) Your calculator has stored the values $x equals 0$ and $y equals 4$ from the TRACE key, so when you press ENTER, the calculator returns $100$ for the value of $C$ at that point. Thus, when $x equals 0$ and $y equals 4$ , $C equals 100$ .

Similarly, you can verify that $C equals 135$ when $x equals 9$ and $y equals 0$ , and that when $x equals 3$ and $y equals 2$ , $C minus 95$ . Thus, the minimum cost of $$ 95$ occurs when $x equals 3$ and $y equals 2$ .

Section Summary

Vocabulary

Look up the definitions of new terms in the Glossary.

Objective function
Constraint
Feasible solution
Optimal solution

CONCEPTS

Linear programming is a technique for finding the maximum or minimum value of an objective function, subject to a system of constraints.
The optimal solution occurs at one of the vertices of the set of feasible solutions.
Note
To Solve a Linear Programming Problem:
1. Represent the unknown quantities by variables. Write the objective function and the constraints in terms of the variables.
2. Graph the solutions to the constraint inequalities.
3. Find the coordinates of each vertex of the solution set.
4. Evaluate the objective function at each vertex.
5. The maximum and minimum values of the objective function occur at vertices of the set of feasible solutions.

STUDY QUESTIONS

Explain the terms objective function, constraints, and feasible solution.
Explain how to solve a linear programming problem by graphing.
How can you find the vertices of the set of feasible solutions?
Where do the maximum and minimum values of the objective function occur?

SKILLS

Practice each skill in the Homework problems listed.

Find the maximum or minimum value for an objective function and a given set of feasible solutions: #1–12
Solve a linear programming problem by graphing: #13–32
Write the objective function and the constraints for a linear programming problem: #19–24

Homework 8.5

For Problems 1–4, find the minimum value of the cost function $C = 3 x + 4 y$ subject to following constraints:

$x plus y greater than or equal to 10, x less than or equal to 8, y less than or equal to 7, x greater than or equal to 0, y greater than or equal to 0$

The graph of the feasible solutions is shown in in the figure.

Use a graph to explain why it is impossible in this situation to have a cost as low as $ $12$ .

Draw the graph of $12 = 3 x + 4 y$ on the graph of the feasible solutions.

The graph of $12 = 3 x + 4 y$ does not intersect the set of feasible solutions.

Use a graph to explain why the cost will not be as great as $ $60$ .

Draw the graph of $60 = 3 x + 4 y$ on the graph of the feasible solutions.

Use a graph to determine which vertex of the shaded region will correspond to the minimum cost. What is the minimum cost?

$open parenthesis 8, 2 close parenthesis$ ; $ $32$

Use a graph to determine which vertex of the shaded region will correspond to the maximum cost. What is the maximum cost?

For Problems 5–8, find the minimum value of the profit function $P = 4 x - 2 y$ subject to the following constraints:

$5 x - y \geq 22, x + y \leq 8, x \geq 0, y \geq 0$

The graph of the feasible solutions is shown in the figure.

Graph the line that corresponds to a profit of $$ 8$ . Find the coordinates of at least one feasible solution that gives a profit of $ $8$ .

$open parenthesis 2, 0 close parenthesis$

Graph the line that corresponds to a profit of $ $22$ . Find the coordinates of at least one feasible solution that gives a profit of $$ 22$ .

Which line is farther from the origin, the line for a profit of $ $8$ or the line for the profit of $ $22$ ?
Use a graph to determine which vertex corresponds to a maximum profit.
Find the maximum profit.

$ $22$
$open parenthesis 8, 0 close parenthesis$
$ $32$

Use a graph to determine which vertex corresponds to a minimum profit.
Find the minimum profit.

For Problems 9–12, objective functions and the graphs of the feasible solutions are given.

Use the graph to find the vertex that yields the minimum value of the objective function, and find the minimum value.
Use the graph to find the vertex that yields the maximum value of the objective function, and find the maximum value.

$C = 3 x + y$

$open parenthesis 1, 4 close parenthesis$ ; $7$
$open parenthesis 4, 5 close parenthesis$ ; $17$

$C = x + 4 y$

$C = 5 x - 2 y$

$open parenthesis 0, 5 close parenthesis$ ; $minus 10$
$open parenthesis 5, 0 close parenthesis$ ; $25$

$C = 2 x - y$

For Problems 13–18,

Graph the set of feasible solutions.
Find the vertex that gives the minimum of the objective function, and find the minimum value.
Find the vertex that gives the maximum of the objective function, and find the maximum value.

Objective function $C = 3 x + 2 y$ with constraints

$\begin{aligned} 2 x + y & \leq 8 \\ 4 x + 6 y & \leq 24 \\ x \geq 0, y & \geq 0 \end{aligned}$

b. $open parenthesis 0, 0 close parenthesis$ ; $0$ c. $open parenthesis 3, 2 close parenthesis$ ; $13$

Objective function $C = - 2 x + y$ with constraints

$\begin{aligned} x - 2 y & \geq - 10 \\ 2 x + y & \leq 10 \\ x \geq 0, y & \geq 0 \end{aligned}$

Objective function $C = 3 x - y$ with constraints

$\begin{aligned} x + y & \leq 14 \\ 5 x + y & \leq 50 \\ x \geq 0, y & \geq 0 \end{aligned}$

b. $open parenthesis 0, 14 close parenthesis$ ; $minus 14$ c. $open parenthesis 0, 0 close parenthesis$ ; $30$

Objective function $C = 5 x + 4 y$ with constraints

$\begin{aligned} 2 x + y & \leq 10 \\ x - 3 y & \geq - 3 \\ x \geq 0, y & \geq 0 \end{aligned}$

Objective function $C = 200 x - 20 y$ with constraints

$\begin{aligned} 3 x + 2 y & \leq 24 \\ x + y & \leq 9 \\ x + 2 y & \leq 16 \\ x \geq 0, y & \geq 0 \end{aligned}$

b. $open parenthesis 0, 8 close parenthesis$ ; $minus 160$ c. $open parenthesis 8, 0 close parenthesis$ ; $1600$

Objective function $C = 54 x + 24 y$ with constraints

$\begin{aligned} 3 x + 2 y & \leq 24 \\ 3 x - y & \leq 15 \\ 3 x - 4 y & \geq - 12 \\ x \geq 0, y & \geq 0 \end{aligned}$

For Problems 19–26, solve each linear programming problem by graphing.

Write a formula for the objective function.
Write a system of inequalities for the constraints.
Graph the set of feasible solutions.
Find the optimum solution.

The math club is selling tickets for a show by a mathemagician. Student tickets will cost $ $1$ and faculty tickets will cost $ $2$ . The ticket receipts must be at least $$ 250$ to cover the fee for the performer. An alumna promises to donate one calculator for each student ticket sold and three calculators for each faculty ticket sold. What is the minimum number of calculators that the alumna will donate?

$C = x + 3 y$
$x greater than or equal to 0, y greater than or equal to 0, x plus 2 y greater than or equal to 250$
$250$

The math department is having a book sale of unwanted textbooks to raise funds for $ $300$ in scholarships. Paperback textbooks will be sold for $ $2$ and the hardcover textbooks will be sold for $ $5$ . If paperback texts weigh $2$ pounds each and hardcover books weigh $3$ pounds each, find the minimum weight of textbooks the department must sell in order to raise its required funds.

Jeannette has $180$ acres of farmland for growing wheat or soy. Each acre of wheat requires two hours of labor at harvest time, and each acre of soy needs one hour of labor. Jeannette will have $240$ hours of labor available at harvest time. Find the maximum profit Jeannette can make from her two crops if she can get a profit of $ $36$ per acre for wheat and $ $24$ per acre for soy.

$P = 36 x + 24 y$
$x greater than or equal to 0$ , $y greater than or equal to 0$ , $x plus y less than or equal to 180$ , $2 x plus y less than or equal to 240$
$ $5040$

Vassilis has at most $ $10, 000$ to invest in two banks. Alpha Bank will pay $6 %$ annual interest and Bank Beta pays $5 %$ annual interest. Alpha Bank will only insure up to $ $6000$ , so Vassilis will invest no more than that with Alpha. What is the maximum amount of interest Vassilis can earn in $1$ year?

Gary's pancake recipe includes corn meal and whole wheat flour. Corn meal has $2.4$ grams of linoleic acid and $2.5$ milligrams of niacin per cup. Whole wheat flour has $0.8$ gram of linoleic acid and $5.2$ milligrams of niacin per cup. These two dry ingredients do not exceed $3$ cups total. They combine for at least $3.2$ grams of linoleic acid and at least $10$ milligrams of niacin. Minimize the number of calories possible in the recipe if corn meal has $433$ calories per cup and whole wheat flour has $400$ calories per cup.

$C = 433 x + 400 y$
$x greater than or equal to 0$ , $y greater than or equal to 0$ , $2.4 x plus 0.8 y greater than or equal to 3.2$ , $2.5 x plus 5.2 y greater than or equal to 10$
$967.7$ cal

Cho requires $1$ hour of cutting and $2$ hours of sewing to make a Batman costume. He requires $2$ hours of cutting and $1$ hour of sewing to make a Wonder Woman costume. At most $10$ hours per day are available for cutting and at most $8$ hours per day are available for sewing. At least one costume must be made each day to stay in business. Find Cho's maximum income from selling one day's costumes if a Batman costume costs $ $68$ and a Wonder Woman costume costs $ $76$ .

For Problems 25–30, use a graphing calculator to find approximate values for the maximum and minimum of the objective function.

Objective function $C = 8.7 x - 4.2 y$ with constraints

$\begin{aligned} 1.7 x - 4.5 y & \geq - 9 \\ 14.3 x + 10.9 y & \leq 28.6 \\ x \geq 0, y & \geq 0 \end{aligned}$

Maximum $17.4$ ; minimum $minus 8.4$

Objective function $C = - 142 x + 83 y$ with constraints

$\begin{aligned} 21 x - 49 y & \geq - 147 \\ 19 x + 21 y & \leq 171 \\ x \geq 0, y & \geq 0 \end{aligned}$

Objective function $C = 312 x + 92 y$ with constraints

$\begin{aligned} 18 x + 17 y & \leq 284 \\ 51 x + 11 y & \leq 656 \\ x \geq 0, y & \geq 0 \end{aligned}$

Maximum $4112$ ; minimum $0$

Objective function $C = 5.3 x + 4.2 y$ with constraints

$\begin{aligned} 2.5 x + 1.7 y & \leq 20.1 \\ 0.09 x - 0.31 y & \geq - 0.39 \\ x \geq 0, y & \geq 0 \end{aligned}$

Objective function $C = 202 x + 220 y$ with constraints

$\begin{aligned} 38 x + 24 y & \leq 294 \\ 35 x + 34 y & \leq 310 \\ 13 x + 29 y & \leq 197 \\ x \geq 0, y & \geq 0 \end{aligned}$

Maximum $1908$ ; minimum $0$

Objective function $C = 54 x + 24 y$ with constraints

$\begin{aligned} 43 x + 32 y & \leq 333 \\ 23 x - 9 y & \leq 152 \\ 73 x - 94 y & \geq - 296 \\ x \geq 0, y & \geq 0 \end{aligned}$

Modeling, Functions, and Graphs by Katherine Yoshiwara (yoshiwarabooks.org), GNU Free Documentation License 1.2 or later. Adapted for the XYZ HTML edition with the authors' permission (recorded 2026-07-04). License: GFDL-1.2-or-later.

	Company A	Company B	Required
Granola	$2 x$	$3 y$	12
Muesli	$x$	$3 y$	9