Exercise 24 Page 158

To find the number of brochures and fliers that minimize the cost, we will follow three steps.

1. We should first write the constraints.
2. Then, we will graph the feasible region and find its vertices.
3. Finally, we will write the objective function and use the vertices to find the minimum cost.

Let's start!

Constraints

Let x be the number of brochures and y be the number of fliers. The manager needs at least 50 brochures and 150 fliers. With this, first two constraints can be written. x≥ 50 & (I) y≥ 150 & (II) For the third constraint, we will use the given data and make an organized table to write it.

As we can see, we have three constraints to write a system. x≥ 50 & (I) y≥ 150 & (II) 3x+2y ≤ 600 & (III)

Feasible Region

To graph the constraints, we should first determine their boundary lines. They can be determined by replacing the inequality symbol with the equals sign. Let's begin with Inequality I and Inequality II. ccc & &Inequality &Boundary Line & I: &x ≥ 50 &x = 50 & II: &y ≥ 150 &y = 150 Boundary Line I is a vertical line that passes through the point (50,0). Boundary Line II is a horizontal line that passes through the point (0,150). Because of the non-strict inequalities, the boundary lines will be solid.

Inequality I states that the points with x-coordinates greater than or equal to 50 are included in the solution. Therefore, we will shade the region to right of Boundary Line I. With the same reasoning, we will shade the region above Boundary Line II.

Next, we will graph Inequality III. Let's first determine its boundary line. cc &Inequality III &Boundary Line III &3x+2y ≤ 600 &3x+2y = 600 The boundary line is in standard form. Therefore, it would be a better option to find its intercepts to graph it. We will substitute y= 0 for the x-intercept and x= 0 for the y-intercept.

Now we can plot the intercepts and connect them with a line segment. Notice that the number of brochures and fliers cannot be negative, so the line will be bound by the axes. The boundary line will also be solid because of the non-strict inequality.

Next, we will decide which region we should shade by testing the point (0,0).

Since the point satisfies the inequality, region that contains the point will be shaded. Let's do it!

The overlapping section of the graph above represents the feasible region. The points of intersection are the vertices of the feasible region.

Vertices (50,150), (50,225), (100,150)

Objective Function and Minimum Cost

Let C be the total cost. We will make an organized table to write a function for the total cost.

To find the number of brochures and fliers that minimize the cost, we will substitute the vertices into the function.

As a result, to minimize the cost, 50 brochures and 150 fliers should be printed. With this, the minimum cost will be $10.