The Objective Function
In linear programming, the function that you are trying to find the maximum or minimum value of is called the objective function. It is displayed in the topleft corner of the Gizmo^{tm}. To modify the objective function, select the button to its left, and then adjust the a, b and c sliders at the bottom of the Gizmo.

Set the objective function to f(x, y) = x + y + 1 by setting the values of a, b, and c to 1. (To quickly set a slider to a specific number, type the number into the field to the right of the slider, and then press ENTER.)

On paper, solve f(x, y) = x + y + 1 for x = 2 and y = 3. What is f(2, 3)? Check your answer by placing the mouse pointer on the graph at (2, 3).

Move the cursor around the graph. Where does the value of the function f(x, y) = x + y + 1 get larger? Where does it get smaller?

Change the value of a to −3. Where does the value of the function f(x, y) = −3x + y + 1 get larger? Where does it get smaller?

Why are your results for f(x, y) = −3x + y + 1 different than the results for f(x, y) = x + y + 1?

Make sure that all of the contraints are turned off and set the objective function to f(x, y) = 2x + y − 2 and examine the graph. Notice that the entire coordinate plane is shaded.

Why is the entire coordinate plane shaded for f(x, y) = 2x + y − 2?

Would you expect this result to be the same for other functions? Why or why not?
The Feasible Region and Optimal Values

Turn on the first three constraints in the Gizmo. Notice that each constraint is written as a linear inequality. Together, these constraints form a system of linear inequalities. The shaded area on the graph represents the set of points that satisfies this system. It is called the feasible region.

Find the coordinates of a point within the feasible region. On paper, substitute its coordinates into each of the constraints. Does the point satisfy each of the constraints?

Do you expect all of the points in the feasible region to satisfy each of the constraints? Why or why not?

Find the coordinates of a point outside the feasible region. On paper, substitute its coordinates into each of the constraints. Does the point satisfy all of the constraints?

Do you expect any point outside the feasible region to satisfy all of the constraints? Why or why not?

Form a feasible region using the following 3 constraints: x + y ≤ 4, −x + y ≤ 4, and y ≥ 0. (To change a constraint, click on the button immediately to its left and then use the sliders at the bottom of the Gizmo to change the a, b and c terms.)

What shape does this system of inequalities form?

A feasible region that has finite area is called a bounded feasible region. If it is has infinite area, it is called an unbounded feasible region. Is the current feasible region bounded or unbounded?

Set the objective function to f(x, y) = 2x + y. Use your mouse to find the maximum value of this function within the feasible region. Where does the maximum occur?

Use your mouse to find the minimum value of this function within the feasible region. Where does the minimum occur?

Click on the DATA tab. The table lists the coordinates of each of the vertices in the feasible region as well as the value of the objective function at each vertex. If an objective function f(x, y) has a maximum value, where must it occur in the feasible region? Is the same true for a minimum?

Set the objective function to f(x, y) = 2x + y. Turn on only two constraints and set them to x + y ≤ 4 and −x + y ≤ 4.

Is the feasible region bounded or unbounded?

Would it be possible to find a maximum value for the objective function in this feasible region? What about a minimum value?

A local jeweler makes earrings and bracelets. In one hour, he can make 3 rings or 2 bracelets. To model the number of items the jeweler can make in a given time period, set the objective function in the Gizmo to f(x, y) = 3x + 2y. In this function, x is the number of hours the jeweler spends making rings, and y is the number of hours spent making bracelets.

On paper, calculate how many total items the jeweler will make if he spends 4 hours making rings and 4 hours making bracelets. Check your answer by placing the mouse pointer at (4, 4).

Suppose the jeweler wants to spend at least 3 hours making rings and at least 3 hours making bracelets. How would you model these two constraints in the Gizmo? Enter these first two constraints in the Gizmo.

The jeweler's third constraint is that he wants to work no more than 8 total hours. How would you model this constraint in the Gizmo. Enter this constraint in the Gizmo.

What is the maximum number of items the jeweler can make in 8 hours?

If the jeweler wants to make the maximum number of items, how many hours must he spend making rings, and how many hours must he spend making bracelets?