Exam

Name___________________________________

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Solve the problem.

1) An appliance store sells two types of refrigerators. Each Cool-It refrigerator sells for $580 and 1)
each Polar sells for $740. Up to 260 refrigerators can be stored in the warehouse and new
refrigerators are delivered only once a month. It is known that customers will buy at least 80
Cool-Its and at least 150 Polars each month. How many of each brand should the store stock and
sell each month to maximize revenues?
A) 80 Cool-Its and 180 Polars B) 110 Cool-Its and 150 Polars
C) 95 Cool-Its and 165 Polars D) 190 Cool-Its and 165 Polars

Use graphical methods to solve the linear programming problem.

2) Minimize z = 4x + 5y 2)
subject to: 2x - 4y ≤ 10
2x + y ≥ 15
x≥0
y≥0

y
10

-10 10 x

-10

A) Minimum of 33 when x = 7 and y = 1 B) Minimum of 20 when x = 5 and y = 0

C) Minimum of 39 when x = 1 and y = 7 D) Minimum of 75 when x = 0 and y = 15

Graph the feasible region for the system of inequalities.

3) 2x + y ≤ 4 3)
x-1≥0
y

4x

1
 A) B)
y y

4x 4x

C) D)
y y

4x 4x

A toy making company has at least 300 squares of felt, 700 oz of stuffing, and 230 ft of trim to make dogs and
dinosaurs. A dog uses 1 square of felt, 4 oz of stuffing, and 1 ft of trim. A dinosaur uses 2 squares of felt, 3 oz of
stuffing, and 1 ft of trim.
4) It costs the company $1.43 to make each dog and $1.89 for each dinosaur. The company wants to 4)
minimize its costs. What are the coefficients of the constraint inequality for trim?
A) 1, 2 B) 1, 1 C) 4, 3 D) 1.43, 1.89

The Acme Class Ring Company designs and sells two types of rings: the VIP and the SST. They can produce up to 24
rings each day using up to 60 total man-hours of labor. It takes 3 man-hours to make one VIP ring, versus 2
man-hours to make one SST ring.
5) How many of each type of ring should be made daily to maximize the company's profit, if the 5)
profit on a VIP ring is $30 and on an SST ring is $60?
A) 12 VIP and 12 SST B) 16 VIP and 8 SST
C) 0 VIP and 24 SST D) 8 VIP and 16 SST

Use the two-stage method to solve.

6) Find x1 ≥ 0 and x2 ≥ 0 such that 6)
x1 + x2 ≤ 50
x1 + x2 ≥ 25
2x1 + x2 ≤ 60
and z = 3x1 + 4x2 is maximized.
A) x1 = 25, x2 = 25, z = 175 B) x2 = 50, x1 = 0, z = 200
C) x1 = 10, x2 = 40, z = 190 D) x1 = 50, x2 = 0, z = 150

2
 7) Find x1 ≥ 0 and x2 ≥ 0 such that 7)
3x1 + 3x2 ≥ 60
2x1 + 5x2 ≤ 120
and z = 5x1 + 4x2 is maximized.
A) x1 = 60, x2 = 0, z = 300 B) x1 = 40, x2 = 8, z = 232
C) x1 = 30, x2 = 20, z = 230 D) x1 = 0, x2 = 24, z = 96

Convert the objective function into a maximization function.

8) Minimize w = y 1 + 3y 2 + y 3 + 4y 4 8)
subject to: y 1 + y 2 + y 3 + y 4 ≥ 16
2y 1 + 2y 2 + y 3 + 2y 4 ≥ 53
y 1 ≥ 0, y 2 ≥ 0, y 3 ≥ 0, y 4 ≥ 0

A) Maximize z = -y 1 - 3y 2 - y 3 - 4y 4
B) Maximize z = -y 1 - y 2 - y 3 - y 4 ≤ -16
C) Maximize z = y 1 + 3y 2 + y 3 + 4y 4 - y 5
D) Maximize z = -2y 1 - 2y 2 - y 3 - 3y 4 ≤ -53

3
Graph the linear inequality.
9) 5x + y ≤ 1 9)
y
10

-10 -5 5 10 x

-5

-10

A) B)
y y
10 10

5 5

-10 -5 5 10 x -10 -5 5 10 x

-5 -5

-10 -10

C) D)
y y
10 10

5 5

-10 -5 5 10 x -10 -5 5 10 x

-5 -5

-10 -10

Convert the constraints into linear equations by using slack variables.

10) Maximize z = 3x1 + 5x2 10)
Subject to: 5x1 + 7x2 ≤ 30
x1 + 4x2 ≤ 40
x1 ≥ 0, x2 ≥ 0
A) 5x1 + 7x2 + x3 ≤ 30 B) 5x1 + 7x2 + x3 = 30
x1 + 4x2 + x4 ≤ 40 x1 + 4x2 + x3 = 40
C) 5x1 + 7x2 + x3 = 30 D) 5x1 + 7x2 = x3 + 30
x1 + 4x2 + x4 = 40 x1 + 4x2 = x4 + 40

4
A manufacturer of wooden chairs and tables must decide in advance how many of each item will be made in a given
week. Use the table to find the system of inequalities that describes the manufacturer's weekly production.
11) Use x for the number of chairs and y for the number of tables made per week. The number of 11)
work-hours available for construction and finishing is fixed.

Hours Hours Total

per per hours
chair table available
Construction 3 5 45
Finishing 3 3 30
A) 5x + 3y ≤ 30 B) 3x + 5y ≤ 45 C) 3x + 5y ≤ 45 D) 5x + 3y ≤ 45
3x + 3y ≤ 45 3x + 3y ≤ 30 3x + 3y ≤ 30 3x + 3y ≤ 30
x≥0 x≥0 x≤0 x≥0
y≥0 y≥0 y≤0 y≥0