Finite Mathematics for Business Economics Life

Sciences and Social Sciences 13th Edition by Barnett

Ziegler and Byleen ISBN 0321945522 9780321945525
Download solution manual at:
https://testbankpack.com/p/solution-manual-for-finite-mathematics-
for-business-economics-life-sciences-and-social-sciences-13th-
edition-by-barnett-ziegler-and-byleen-isbn-0321945522-
9780321945525/

Download full test bank at :

https://testbankpack.com/p/test-bank-for-finite-mathematics-for-
business-economics-life-sciences-and-social-sciences-13th-edition-
by-barnett-ziegler-and-byleen-isbn-0321945522-9780321945525/

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

Refer to the given system to solve the

problem.
1) Find the solution of the system for which x2 = 0 and s1 = 0

5x1 + 3x2 + s1 = 90
2x1 + 4x2 + s2 = 64
A) (x1, x2 , s1 , s2 ) = (90, 0, 0, 64)
B) (x1 , x2 , s1 , s2 ) = (16, 0, 0, 42)
C) (x1 , x2 , s1 , s2 ) = (32, 0, 0, 45)
D) (x1 , x2 , s1 , s2 ) = (18, 0, 0, 28)
Answer: D

Write the e-system obtained via slack variables for the linear programming problem.
2) Maximize P = 2x1 +
8x2
subject to: x1 + 4x2 ≤

15
2x1 + 9x2 ≤
25 with: x1 ≥ 0, x2 ≥
0
A) x1 + 4x2 + s1 ≤ 15
2x1 + 9x2 + s2 ≤ 25
1
 B) x1 + 4x2 = s1 + 15
2x1 + 9x2 = s2 + 25
C) x1 + 4x2 + s1 = 15
2x1 + 9x2 + s1 = 25
D) x1 + 4x2 + s1 = 15
2x1 + 9x2 + s2 = 25
Answer: D

3) Maximize P = 3x1 + 5x2

subject to: 2x1 + 9x2 ≤
30
x1 + 9x2 ≤ 40
with: x1 ≥ 0, x2 ≥ 0
A) 2x1 + 9x2 + s1 = 30
x1 + 9x2 + s2 = 40
B) 2x1 + 9x2 + s1 ≤ 30
x1 + 9x2 + s2 ≤ 40
C) 2x1 + 9x2 = s1 + 30
x1 + 9x2 = s2 + 40
D) 2x1 + 9x2 + s1 = 30
x1 + 9x2 + s1 = 40
Answer: A

2
Provide an appropriate
response.
4) Maximize P= x1 + 2x2 +
3x3
subject to: x1 + 8x2 + 5x3 ≤ 40
9x1 + x2 + 7x3 ≤ 50
with: x1 ≥ 0, x2 ≥ 0, x3 ≥ 0
How many slack variables must be introduced to form the system of problem constraint equations?
A) 3
B) 2
C) 1
D) 0
Answer: A

5) Convert the inequality to a linear equation by adding a slack

variable. x1 + 6x2 ≤ 35
A) x1 + 6x2 + s1 ≤ 35
B) x1 + 6x2 + s1 + 35 = 0
C) x1 + 6x2 + s1 < 35
D) x1 + 6x2 + s1 = 35
Answer: D

6) Convert the inequality to a linear equation by adding a slack variable.

9x1 + x2 + 4x3 ≤ 240
A) 9x1 + x2 + 4x3 + s1 ≥ 240
B) 9x1 + x2 + 4x3 + s1 ≤ 240
C) 9x1 + x2 + 4x3 + s1 + 240 = 0
D) 9x1 + x2 + 4x3 + s1 = 240
Answer: D

3
Refer to the table of the six basic solutions to the e-system.
7)
4x1 + 5x2 + s1 = 60
x1 + 2x2 + s2 = 18

x1 x2 s1 s2
(A) 0 0 60 18
(B) 0 12 0 -6
(C) 0 9 15 0
(D) 15 0 0 3
(E) 18 0 -12 0
(F) 10 4 0 0

In basic solution (B), identify the basic and nonbasic variables and determine if the solution is feasible or
not
feasible.
A) Basic variables: x2 ,
s1
Nonbasic variables: x1 , s2
Solution is not feasible.
B) Basic variables: x2 , s2
Nonbasic variables: x1 , s1
Solution is not
feasible. C) Basic
variables: x2 , s2
Nonbasic variables: x1 , s1
Solution is feasible.
D) Basic variables: x1 ,
s2
Nonbasic variables: x2 , s1
Solution is not
feasible. Answer: B

4
 8)
x1 + 2x2 + s1 = 14
3x1 + 4x2 + s2 = 36

x1 x2 s1 s2
(A) 0 0 14 36
(B) 0 7 0 8
(C) 0 9 -4 0
(D) 14 0 0 -6
(E) 12 0 2 0
(F) 8 3 0 0

Which of the six basic solutions are feasible? Which are not feasible? Use the basic feasible solutions to
find the maximum value of P = 24x1 + 18x2 .
A) Feasible: (A), (B), (E), (F); Not feasible: (C),
(D); The maximum value of P is 246.
B) Feasible: (A), (E), (F); Not feasible: (C), (D),
(B); The maximum value of P is 288.
C) Feasible: (A), (B), (E), (F); Not feasible: (C), (D);
The maximum value of P is 126.
D) Feasible: (A), (B), (E), (F); Not feasible: (C), (D);
The maximum value of P is
288. Answer: D

9) The following chart depicts basic solutions to a system of linear inequalities. Which of the solutions is
NOT
feasible?

x 1 x2 s1 s2
(A) 0 0 11 6
11 4
(B) 0 0 -
3 3
(C) 0 3 2 0
11 1
(D) 0 0
2 2
(E) 6 0 -1 0
(F) 4 1 0 0
A) (B) and (E)

B) (B)
C) (A), (B), (C)
D) (A), (D), (E), (F)
Answer: A

Convert the given i-system to an e-system using slack variables. Then construct a table of all basic solutions
of the e-system. For each basic solution, indicated whether or not it is feasible.

5
10) x1 + 4x2 ≤ 24
3x1 + x2 ≤ 12
x1, x2 ≥ 0
A) x1 + 4x2 + s1 = 24
3x1 + x2 + s2 = 12
x1 x2 s1 s2
(A) 0 0 12 24
(B) 0 6 0 6
(C) 0 12 -24 0
(D) 24 0 0 -60
(E) 4 0 20 0
60 24
(F) 0 0
11 11

Feasible: (A), (B), (E), (F)

Not feasible: (C),
(D) B) x1 + 4x2 + s1
≤ 24

3x1 + x2 + s2 ≤ 12
x1 x2
s1 s2
(A) 0 0 24 12
(B) 0 6 0 6
(C) 0 12 -24 0
(D) 24 0 0 -60
(E) 4 0 20 0
24 24
(F) - - 0 0
11 11

Feasible: (A), (B), (E)

Not feasible: (C), (D),
(F) C) x1 + 4x2 + s1 =
24
3x1 + x2 + s2 = 12
x1 x2 s1 s2
(A) 0 0 12 24
(B) 0 6 0 -6
(C) 0 12 24 0
(D) 24 0 0 60
(E) 4 0 -20 0
60 24
(F) 11 11 0 0

Feasible: (A), (C), (D), (F)

Not feasible: (B), (E)

6
 D) x1 + 4x2 + s1 = 24
3x1 + x2 + s2 = 12
x 1 x2 s1 s2
(A) 0 0 24 12
(B) 0 6 0 6
(C) 0 12 -24 0
(D) 24 0 0 -60
(E) 4 0 20 0
24 60
(F) 0 0
11 11

Feasible: (A), (B), (E), (F)

Not feasible: (C),
(D) Answer: D

11) 6x1 + 5x2 ≤

30 x1, x2 ≥ 0
A) 6x1 + 5x2 + s1 ≤ 30

x 1 x2 s1
(A) 0 0 30
(B) 0 6 0
(C) 5 0 0

Feasible: (B), (C)

Not feasible: (A)
B) 6x1 + 5x2 + s1 = 30

x 1 x2 s1
(A) 0 0 30
(B) 0 5 0
(C) 6 0 0

Feasible: (A), (B), (C)

Not feasible: none
C) 6x1 + 5x2 + s1 = 30

x 1 x2 s1
(A) 0 0 30
(B) 0 6 0
(C) 5 0 0

Feasible: (A), (B), (C)

Not feasible: none

7
 D) 6x1 + 5x2 + s1 = 30

x1 x2 s1
(A) 0 0 30
(B) 0 -6 0
(C) -5 0 0

Feasible: (A)
Not feasible: (B), (C)
Answer: C

Graph the system of

inequalities.
12) x1 + x2 ≤ 12
2x1 + x2 ≤ 20
x1, x2 ≥ 0
A)
x2
24
22
(0, 20)
20
18
16
14
12 (0, 12)
10
8
6
(8, 4)
4
2
(10, 0) (12, 0)

2 4 6 8 10 12 14 16 18 20 22 x1

B)
x2
24

(0, 20)
20
18
16
14
12 (0, 12)
10
8

(8, 4)
4
2
(10, 0) (12, 0)
2 4 6 8 10 12 14 16 18 20 22 x1

8
 C)
2
x2
24

(0, 20)
20
18
16
14
12 (0, 12)
10
8

(8, 4)
4
2
(10, 0) (12, 0)
2 4 6 8 10 12 14 16 18 20 22 x1
D)
x2
24
22
(0, 20)
20
18
16
14
12 (0, 12)
10
8
6
(8, 4)
4
2
(10, 0) (12, 0)

2 4 6 8 10 12 14 16 18 20 22 x1

Answer: D
13) x1 + x2 ≤ 40
3x1 + x2 ≤ 84
x1, x2 ≥ 0
A)
(13, 45)
x2
2
40
35
30
25

(22, 18)
15
10
5
(28, 0)
5 10 15 20 25 30 35 40 x1

9
 (13, 45)
x2
40
35
30
25
(22, 18)
15
10
5
(40,
5 10 15 20 25 30 35 40 x1
C)
x2
45
40 (0, 40)
35
30
25
20
(22, 18)
15
10
5
(28, 0) (40, 0)
5 10 15 20 25 30 35 40 45 x1

D)
x2
40
35
30
25
(22, 18)
15
10
5
(40,
5 10 15 20 25 30 35 40 x1

Answer: C

10
 Solve the given linear programming problem using the table
method.
14) Maximize P = 6x1 + 7x2
subject to 2x1 + 3x2 ≤
12
2x1 + x2 ≤ 8
x1, x2 ≥ 0
A) Max P = 32 at x1 = 2, x2 = 3
B) Max P = 55 at x1 = 4, x2 = 4
C) Max P = 32 at x1 = 3, x2 = 2
D) Max P = 24 at x1 = 4, x2 = 0
Answer: C

15) Maximize P = 7x1 +

6x2 subject to 3x1 + x 2
≤ 21 x1 + x 2 ≤ 10

x1 + 2x2 ≤ 12
x1, x2 ≥ 0
A) Max P = 60 at x1 = 6, x2 = 3
B) Max P = 66 at x1 = 6, x2 = 4
C) Max P = 68 at x1 = 8, x2 = 2
D) Max P =65.5 at x1 = 5.5, x2 = 4.5
Answer: A

Solve the problem.

16) A linear programming problem has 4 decision variables, x1 to x4 , and 8 problem constraints. How many
rows are there in the table of basic solutions of the associated e-system?
A) 248
B) 11,880
C) 495
D) 24
Answer: C

17) A linear programming problem has 45 decision variables x1 , ..., x45 and70 problem constraints. How
many rows are there in the table of basic solutions of the associated e-system?
A) 2.04 × 1022
B) 2.04 × 1032
C) 6.46 × 1032
D) 2.04 × 1034
Answer: B

11
Provide an appropriate response.
18) Write the basic solution for the following simplex tableau:
x1 x2 x 3 s 1 s 2 P
3 4 0 3 1 0 20
1 5 1 7 0 0 28
-3 4 0 1 0 1 20
A) x1 , x2 , s1 = 0, x1 = 28, s2 = 20, P = 20
B) x1 , x2 , s1 = 0, x3 = 28, s2 = 20, P = 20
C) x1 , x2 , s1 = 0, x5 = 28, s2 = 20, P = 20
D) x1 , x2 , s1 = 0, x3 = 20, s2 = 28, P = 20
Answer: B

19) Write the basic solution for the following simplex tableau:

x1 x2 x3 s1 s2 s3 P
0 10 7 0 1 1 0 12
1 - 7 6 0 0 1 0 28
0 0 10 1 0 0 0 30
0 -5 -8 0 0 4 1 50
A) x1 = 28, x2 = 0, x3 = 0, s1 = 30, s2 = 12, s3 = 0, P = - 50
B) x1 = 28, x2 = 10, x3 = 0, s1 = 30, s2 = 12, s3 = 0, P = 50
C) x1 = 28, x2 = 10, x3 = 7, s1 = 30, s2 = 12, s3 = 0, P = 50
D) x1 = 28, x2 = 0, x3 = 0, s1 = 30, s2 = 12, s3 = 0, P = 50
Answer: D

20) Write the basic solution for the following simplex tableau:

x1 x2 s1 s2 s3 P
1
2 1 0 0 0 10
2
1
3 0 - 1 0 0 40
2
-2 0 -1 0 1 0 4
14 0 6 0 0 1 120
A) x1 = 5, x2 = 10, s1 = 0, s2 = 40, s3 = 4, P = 120
B) x1 = 0, x2 = 10, s1 = 0, s2 = 40, s3 = 4, P = -120
C) x1 = 0, x2 = 10, s1 = 0, s2 = 40, s3 = 4, P = 120
D) x1 = 0, x2 = 10, s1 = 1, s2 = 40, s3 = 4, P = 120
Answer: C

12
21) Write the simplex tableau, label the columns and rows for the linear programming
problem: Maximize P = 4x1 + x2 subject to
2x1 + 5x2 ≤ 9
3x1 + 3x2 ≤ 2
x1 , x2 ≥ 0

A) x1 x2 s1 s2 P
2 5 1 0 0 2
3 3 0 1 0 9
4 1 0 0 1 0
B) x1 x2 s1 s2 P
2 5 1 0 0 9
3 3 0 1 0 2
4 1 0 0 1 0

C) x1 x2 s1 s2 P
2 5 1 0 0 2
3 3 0 1 0 9
-4 -1 0 0 1 0
D) x1 x2 s1 s2 P
2 5 1 0 0 9
3 3 0 1 0 2
-4 -1 0 0 1 0

Answer: D

22) Write the simplex tableau, label the columns and rows, underline the pivot element, and identify the
entering and exiting variables for the linear programming problem:

Maximize P = 5x1 +
3x2 subject to
3x1 + 8x2 ≤ 5
3x1 + 5x2 ≤ 6
-8x1 + 6x2 ≤ 32
6x2 ≤ 3
x1, x2 ≥ 0
A) Enter
x1 x 2 s1 s2 s3 s4 P
s1
3 8 1 0 0 1 0 8
s2 3 5 0 1 0 0 0 6
Exit
s3 -8 6 0 0 1 0 0 32
s4 0 6 0 0 0 1 0 3
P -5 -3 0 0 0 0 1 0

13
 B) Exit
x1 x 2 s1 s2 s3 s4 P
s1
3 8 1 0 0 1 0 5
s2 3 5 0 1 0 0 0 6
Enter
s3 -8 6 0 0 1 0 0 32
s4 0 6 0 0 0 1 0 3
P -5 -3 0 0 0 0 1 32
C) Exit
x1 x 2 s1 s2 s3 s4 P
s1
3 8 1 0 0 0 0 6
s2 3 5 0 1 0 0 0 6
Enter
s3 -8 6 0 0 1 0 1 32
s4 0 6 0 0 0 1 0 3
P -5 -3 0 0 0 0 1 0
D) Enter
x1 x 2 s1 s2 s3 s4 P
s1
3 8 1 0 0 0 0 5
s2 3 5 0 1 0 0 0 6
Exit
s3 -8 6 0 0 1 0 0 32
s4 0 6 0 0 0 1 0 3
P -5 -3 0 0 0 0 1 0

Answer: D

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

23) State whether the optimal solution has been found, an additional pivot is required, or there is no solution
for the problem corresponding to the following simplex tableau:

x1 x2 x3 s1 s2 s3 P
1 0 0 3 1 1 0 8
0 1 0 -2 0 0 0 40
-2 0 1 2 1 0 0 5
1 0 0 4 2 0 1 54
Answer: Optimal solution has been found.

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

Introduce slack variables as necessary, and write the initial simplex tableau for the problem.
24) Find x1 ≥ 0 and x2 ≥ 0 such that
2x1 + 5x2 ≤ 19
3x1 + 3x2 ≤ 18
and z = 4x1 + x2 is maximized.

A) x1 x2 s1 s2 z
2 5 1 0 0 18
3 3 0 1 0 19
4 1 0 0 1 0
B) x1 x2 s1 s2 z
2 5 1 0 0 19
3 3 0 1 0 18
-4 -1 0 0 1 0
C) x1 x2 s1 s2 z
2 5 1 0 0 19
3 3 0 1 0 18
4 1 0 0 1 0
D) x1 x2 s1 s2 z
2 5 1 0 0 18
3 3 0 1 0 19
-4 -1 0 0 1 0
Answer: B

15
25) Find x1 ≥ 0 and x2 ≥ 0 such
that x1 + x2 ≤ 87
3x1 + x2 ≤ 189
and z = 2x1 + x2 is maximized.

A) x1 x2 s1 s2 z
1 1 1 0 0 87
3 1 0 1 0 189
-2 -1 0 0 1 0
B) x1 x2 s1 s2 z
1 1 1 0 0 189
3 1 0 1 0 87
-2 -1 0 0 1 0
C) x1 x2 s1 s2 z
1 1 1 0 0 87
3 1 0 1 0 189
2 1 0 0 1 0
D) x1 x2 s1 s2 z
1 1 1 0 0 189
3 1 0 1 0 87
2 1 0 0 1 0
Answer: A

16
SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

Provide an appropriate response.

26) For the following initial simplex tableau, identify the basic and nonbasic variables. Find the pivot element,
the
entering and exiting variables, and perform one pivot operation.

x y s1 s2 P
s1 3 5 1 0 0 15
s2 4 1 0 1 0 4
P -15 -10 0 0 1 0
Answer: Basic: s1 , s2 , P; nonbasic: x, y;

x y s1 s2 P
s1 3 5 1 0 0 15 Enter x, Exit s
s2 2
(4) 1 0 1 0 4
P -15 -10 0 0 1 0

x y s1 s2 P
17 3
s1 0 1 - 0 12
4 4
1 1
x 1 0 0 1
4 4
25 15
P 0- 0 1 15
4 4

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

Pivot once about the circled element in the simplex tableau, and read the solution from the result.
27)

A) x1 = 24, s2 = -16, z = 24; x2 , x3 , s1 = 0

B) x1 = 48, s2 = -16, z = -48; x2 , x3 , s1 = 0
C) x1 = 48, s2 = 16, z = 48; x2 , x3 , s1 = 0
D) x1 = 24, s2 = -16, z = -24; x2 , x3 , s2 = 0
Answer: A

17
 28)

A) x3 = 5, x2 = -7, z = -10; x1 , s1 , s2 = 0
B) x3 = 10, x2 = 10, z = 7; x1 , s1 , s2 = 0
C) x3 = 5, x2 = -7, z = 10; x1 , s1 , s2 = 0
D) x3 = 10, x2 = 7, z = 10; x1 , s1 , s2 = 0
Answer: A

Provide an appropriate response.

29) Solve the following linear programming problem using the simplex
method: Maximize P = x1 - x2
subject to
x 1 + x2 ≤ 4
2x1 + 7x2 ≤ 14
x1 , x2 ≥ 0
A) Max P = 4 at x1 = 14 and x2 =
0
B) Max P = 4 at x1 = 4 and x2 =
4
C) Max P = 14 at x 1 = 4 and x2 =
0
D) Max P = 4 at x1 = 4 and x2 =
0
Answer: D

30) Solve the following linear programming problem using the simplex
method: Maximize P = 5x1 + 3x2
subject to
2x1 + 4x2 ≤ 13
x1 + 2x2 ≤ 6
x 1 , x2 ≥ 0
A) Max P = 18 when x1 = 0, x2 =
6
B) Max P = 32.5 when x1 = 6.5, x2 = 0
C) Maxi P = 9 when x1 = 0, x2 =
3
D) Max P = 30 when x1 = 6, x2 =
0
Answer: D

18
 31) Solve the following linear programming problem using the simplex
method: Maximize P = 7x1 + 2x2 + x 3
subject to:
x1 + 5x2 + 7x3 ≤ 8
x1 + 4x2 + 11x3 ≤ 9
x1 , x2 , x3 ≥ 0
A) Max P = 0 when x1 = 0, x2 = 0, x3 =
8
B) Max P = 63 when x1 = 9, x2 = 0, x3 = 0
C) Max P = 56 when x1 = 8, x2 = 0, x3 = 0
D) Max P = 9 when x1 = 1, x2 = 1, x3 =
0
Answer: C

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the

question. Solve the problem.

32) Big Round Cheese Company has on hand 45 pounds of Cheddar and 49 pounds of Brie each day. It
prepares two Christmas packages the "Holiday" box, which has 5 pounds of Cheddar and 2 pounds of
Brie, and the
"Noel" box, which contains 2 pounds of Cheddar and 7 pounds of Brie. Profit on each Holiday assortment
is $6, profit on each Noel assortment is $8.

(a) Give the optimal production schedule and the resulting maximum profit.
(b) How much excess Cheddar and excess Brie remain each day if this plan is followed?
Answer: (a) 7 Holiday boxes, 5 Noel boxes; , Maximum profit =
$82 (b) none

33) A stereo manufacturer makes three types of stereo systems, I, II, and III, with profits of $20, $30, and $40,
respectively. No more than 100 type-I systems can be made per day. Type-I systems require 5 man-hours,
and the corresponding numbers of man-hours for types II and III are 10 and 15, respectively. If the
manufacturer has available 2000 man-hours per day, determine the number of units from each system that
must be
manufactured in order to maximize profit. Compute the corresponding
profit. Answer: 100 of type-I, 150 of type-II, and none of type-III systems;
maximum profit =
$6500

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

Find the transpose of the matrix.

34)
902
213
987
A)
029
132
879
B)
212
902
987
C)
987
213
902
D)
929
018
237

Answer: D
35)
1693
1786
A)
36
61
36
98
B)
11
67
98
36
C)
1786
1693
D)
11
76
89
63
Answer: B

20
Provide an appropriate
response.
36) Formulate the dual problem for the linear programming problem:

Minimize
C = 3x1 + x2
subject to
2x1 + 3x2 ≥ 60
x1 + 4x2 ≥ 40
x1 , x2 ≥ 0
A) Maximize P = 3y1 + y2
subject to
2y1 + y2 ≤ 3
3y1 + 4y2 ≥ 1
y1 , y2 ≥ 0
B) Maximize P = 60y1 + 40y2
subject to
2y1 + y2 ≤ 3
3y1 + 4y2 ≤ 1
y1 , y2 ≥ 0
C) Maximize P = 3y1 + y2
subject to
2y1 + y2 ≤ 3
3y1 + 4y2 ≤ 1
y1 , y2 ≥ 0
D) Maximize P = 60y1 + 40y2
subject to
2y1 + y2 ≥ 3
3y1 + 4y2 ≥ 1
y1 , y2 ≥ 0

Answer: B

21
37) Formulate the dual problem for the linear programming
problem:
Minimize C = 22x1 + 15x2
subject to
x1 + 2x2 ≥ 3
x 1 + x2 ≥ 2
x1 , x2 ≥ 0
A) Maximize P = 3y1 + 2y2
subject to
y1 + y2 ≤ 22
2y1 + y2 ≤ 15
y1 , y2 ≥ 0
B) Maximize P = 3y1 + 2y2
subject to
y1 + y2 ≥ 22
2y1 + y2 ≥ 15
y1 , y2 ≥ 0
C) Maximize P = 22y1 + 15y2
subject to
y1 + y2 ≤ 22
2y1 + y2 ≤ 15

y1 , y2 ≥ 0
D) Maximize P = 3y1 + 2y2
subject to
y1 + y2 ≥ 3
2y1 + y2 ≥ 2
y1 , y2 ≥ 0

Answer: A

22
38) Formulate the dual problem for the linear programming
problem:
Minimize C = 3x1 + x 2
subject to
2x1 + 3x2 ≥ 60
x1 + 4x2 ≥ 40
x1 , x2 ≥ 0
A) Maximize P = 3y1 + y2
subject to
2y1 + y2 ≥ 3
3y1 + 4y2 ≥ 1
y1 , y2 ≥ 0
B) Maximize P = 60y1 + 40y2
subject to
2y1 + y2 ≥ 3
3y1 + 4y2 ≥ 1
y1 , y2 ≥ 0
C) Maximize P = 60y1 + 40y2
subject to
2y1 + y2 ≤3
3y1 + 4y2 ≤1

y1 , y2 ≥ 0
D) Maximize P = 3y1 + y2
subject to
2y1 + y2 ≤ 3
3y1 + 4y2 ≤ 1
y1 , y2 ≥ 0

Answer: C

23
39) Formulate the dual problem for the linear programming
problem:
Minimize C = 6x1 + x2 + 5x3
subject to
8x1 + x2 ≥ 2
8x2 + 5x3 ≥ 16
x1 , x2 , x3 ≥ 0
A) Maximize P = 2y1 +
16y2
subject to
8y1 ≤ 6
y1 + 8y2 ≤ 1
5y2 ≤ 5
y1 , y2 ≥ 0
B) Maximize P = 16y1 + 2y2
subject to
8y1 ≤ 6
y1 + 8y2 ≤ 1
5y2 ≤ 5
y1 , y2 ≥ 0
C) Maximize P = 2y1 + 16y2
subject to
8y1 ≤ 6
y1 + 8y2 ≤ 1
5y2 ≤ 5
y1 , y2 ≤ 0
D) Maximize P = 2y1 + 16y2
subject to
8y1 ≥ 6
y1 + 8y2 ≥ 1
5y2 ≤ 5
y1 , y2 ≥ 0
Answer: A

24
40) State the dual problem.
Minimize C = 6x1 + 3x2
subject to: 3x1 + 2x2 ≥ 34
2x1 + 5x2 ≥ 43
x1 , x 2 ≥ 0
A) Maximize P = 43y1
+34y2
subject to: 2y1 + 3y2 ≥
6
5y1 + 2y2 ≥ 3
y1 , y2 ≥ 0
B) Maximize P =34y1 +
43y2
subject to: 3y1 + 2y2 ≤
6
2y1 + 5y2 ≤ 3
y1 , y2 ≥ 0
C) Maximize P = 43y1
+34y2
subject to: 2y1 + 3y2 ≤
6
5y1 + 2y2 ≤ 3
y1 , y2 ≥ 0
D) Maximize P = 34y1
+43y2
subject to: 3y1 + 2y2 ≥
6
2y1 + 5y2 ≥ 3
y1 , y2 ≥ 0
Answer: B

25
 41) Formulate the dual problem for the linear programming problem

Minimize C = 4x1 +
7x2 subject to
x 1 + x2 ≥ 5
x1 + 2x2 ≤ 18
3x1 + x2 ≥ 8
x1 , x2 ≥ 0
A) Maximize P = 5y1 + 18y2 -
8y3
subject to
y1 - 2y2 + y3 ≤ 7
y1 - y2 + 3y3 ≤ 4
y1 , y2 , y3 ≥ 0
B) Maximize P = 5y1 - 18y2 + 8y 3
subject to
y1 - 2y2 + y3 ≤ 7
y1 - y2 + 3y3 ≤ 4
y1 , y2 , y3 ≤ 0
C) Maximize P = 5y1 - 18y2 + 8y 3
subject to
y1 - 2y2 + y3 ≥ 7
y1 - y2 + 3y3 ≥ 4
y1 , y2 , y3 ≥ 0
D) Maximize P = 5y1 - 18y2 + 8y 3
subject to
y1 - 2y2 + y3 ≤ 7
y1 - y2 + 3y3 ≤ 4
y1 , y2 , y3 ≥ 0

Answer: D

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

Solve the problem.

42) Consider the following linear programming problem.
2x + 3y ≤ 9
Maximize P = 5x + 6y subject x + y≤4
to x ≥ 0, y ≥ 0

The associated final simplex tableau is as follows:

x y u v P
0 1 1 -2 0 1
1 0 -1 3 0 3
0 0 1 3 1 21

Find the optimal solution of the minimization problem.

Answer: Min C = 21 at u =1 and v = 3

25
 43) Consider the following linear programming problem.
x - 2z ≤ 10
Maximize P = 3x + 2y + 5z subject x + y + 6z ≤ 80
to x ≥ 0, y ≥ 0, z ≥ 0.

The associated final simplex tableau is as follows:

x y z u v P
1 0 -2 1 0 0 10
0 1 8 -1 1 0 70
0 0 5 1 2 1 170

Find the optimal solution of the minimization problem .

Answer: Min C = 170 at u =1 and v = 2

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

question. Provide an appropriate response.

44) Use the simplex method to solve the linear programming problem.
Minimize w = 5y1 + 2y2
subject to: y1 + y2 ≥ 19.5
2y1 + y2 ≥ 24
y1 ≥ 0, y2 ≥ 0
A) 54 when y1 = 24 and y2 = 1
B) 30.5 when y1 = 4.5 and y2 =
0
C) 31.5 when y1 = 1 and y2 =
2
D) 48 when y1 = 0 and y2 = 24
Answer: D

45) Solve the following linear programming problem by applying the simplex method to the dual

problem: Minimize C = 3x1 + 2x2

subject to
x1 + 7x2 ≥ 2
2x1 + x2 7 ≥

7x1 + 9x2 ≥ 1
x1 , x2 ≥ 0
7 21
A) Min C = at x1 = , x2 = 0
2 2
7
B) Min C = 21 at x1 = ,x =0
2 2
21 7
C) Min C = at x1 = 0, x2 =
2 2
21 7
D) Min C = at x1 = , x2 = 0
2 2
Answer: D

26
 46) Solve the linear programming problem by using the simplex method.

Minimize f = 5x +
3y subject to: 2x + 3y
≥9
2x + y ≥ 11
x ≥ 0, y ≥ 0
A) x = 0, y = 11, f = 33
B) x = 5, y = 0, f = 25
11 55
C) x = , y = 0, f =
2 2
D) x = 5, y = 1, f = 28
Answer: C

Solve the problem.

47) A summer camp wants to hire counselors and aides to fill its staffing needs at minimum cost. The
average
monthly salary of a counselor is $2400 and the average monthly salary of an aide is $1100. The camp can
accommodate up to 45 staff members and needs at least 30 to run properly. They must have at least 10
aides,
and may have up to 3 aides for every 2 counselors. How many counselors and how many aides
should the camp hire to minimize cost?
A) 27 counselors and 18 aides
B) 18 counselors and 12 aides
C) 35 counselors and 10 aides
D) 12 counselors and 18 aides
Answer: D

27
Provide an appropriate response.
48) Write the modified problem for the following linear programming problem (DO NOT SOLVE):

Maximize P = 9x1 - 4x2 +

x3 subject to
4x1 - x2 + 2x3 ≤ 3
-x1 - 7x2 + 9x3 ≤ -4
x1 - x2 + 2x3 = 8
x1 , x2 , x3 ≥ 0
A) Maximize P = 9x1 - 4x2 + x3 - Ma1 -
Ma2
subject to
4x1 - x2 + 2x3 + s1 = -3
x1 + 7x2 - 9x3 - s2 + a 1 = -4
x1 - x2 + 2x3 + a 2 = - 8
x1 , x2 , x3 , s1 , s2 , a 1 , a 2 ≥ 0
B) Maximize P = 9x1 - 4x2 + x3 + Ma1 + Ma2
subject to
4x1 - x2 + 2x3 + s1 = 3
x1 + 7x2 - 9x3 - s2 + a 1 = 4
x1 - x2 + 2x3 + a 2 = 8
x1 , x2 , x3 , s1 , s2 , a 1 , a 2 ≤ 0
C) Maximize P = 9x1 - 4x2 + x3 - Ma1 - Ma2
subject to
4x1 - x2 + 2x3 + s1 = 3
x1 + 7x2 - 9x3 - s2 + a 1 = 4
x1 - x2 + 2x3 + a 2 = 8
x1 , x2 , x3 , s1 , s2 , a 1 , a 2 ≥ 0
D) Maximize P = 9x1 - 4x2 + x3 + Ma 1 + Ma 2
subject to
4x1 - x2 + 2x3 + s1 = -3
x1 + 7x2 - 9x3 - s2 + a 1 = -4
x1 - x2 + 2x3 + a 2 = - 8
x1 , x2 , x3 , s1 , s2 , a 1 , a 2 ≥ 0

Answer: C

28
49) Find the initial simplex tableau for the following preliminary simplex tableau (DO NOT SOLVE):

x1 x2 s1 s2 s3 a 1 a 2 P
2 1 -1 0 0 1 0 0 7
1 3 0 -1 0 0 1 0 12
1 1 0 0 1 0 0 0 5
-4 -9 0 0 0 MM 1 0
A)
x1 x2 s1 s2 s3 a 1 a 2 P
a1
2 1 -1 0 0 1 0 0 7
a2 1 3 0 -1 0 0 1 0 12
s3 1 1 0 0 1 0 0 0 5
P -3M-4 -4M-9 M M 0 0 0 -19M
1
B)
x1 x2 s1 s2 s3 a1 a2 P
a1
2 1 -1 0 0 1 0 0 -7
a2 1 3 0 -1 0 0 1 0 -12
s3 1 1 0 0 1 0 0 0 -5
P 3M-4 4M-9 M M 0 0 0 -1 19M
C)
x1 x2 s1 s2 s3 a1 a2 P
a1
2 1 -1 0 0 1 0 0 7
a2 1 3 0 -1 0 0 1 0 12
s3 1 1 0 0 1 0 0 0 5
P 3M-4 4M-9 M M 0 0 0 -1 19M
D)
x1 x2 s1 s2 s3 a1 a2 P
a1
2 1 -1 0 0 1 0 0 7
a2 1 3 0 -1 0 0 1 0 12
s3 1 1 0 0 1 0 0 0 5
P 3M-4 4M-9 M M 0 0 0 1 -19M
Answer: A

50) Use the big M method to solve the following linear programming problem.

Maximize P = 6x1 + 4x2 +

x3 subject to
x1 + 3x2 + 6x3 ≤ 18
x 1 + x 2 + x3 ≥ 5
x1 , x2 , x3 ≥ 0
A) Max P = 108 at x1 = 18, x2 = 0, x3 =
0
B) Max P = 108 at x1 = 0, x2 = 18, x3 =
0
C) Max P = 108 at x1 = 0, x2 = 0, x3 =
18

29
 D) Max P = 108 at x1 = 18, x2 = 0, x3 =
9
E) Max P = -108 at x1 = 18, x2 = 0, x3 =
0
Answer: A

30
51) Use the big M method to find the optimal solution to the problem.
Maximize P = 6x1 + 2x2
subject to x1 + 2x2 ≤ 20
2x1 + x2 ≤ 16
x 1 + x2 ≥ 9
x1 , x2 ≥ 0
A) max P = 46 at x1 = 2 , x2 = 7
B) max P = 46 at x1 , x2 = 2
C) max P = - 46 at x1 = 2 , x2 = 7
D) max P = 46 at x1 = 7 , x2 = 2
Answer: D

52) Use the big M method to find the optimal solution to the problem.
Maximize P = 3x1 + 6x2 + 2x 3
subject to 2x1 + 2x2 + 3x3 ≤ 12
2x1 + 2x2 + x3 = 0
x1 , x2 , x3 ≥ 0
A) Max P = 27 at x1 = 0, x2 = 3, x3 = 3
B) Max P = -27 at x1 = 3, x2 = 3, x3 = 3
C) Max P = 27 at x1 = 3, x2 = 3, x3 = 0
D) Max P = 27 at x1 = 3, x2 = 3, x3 = 3
Answer: C

30
SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

53) Consider the linear programming problem:

Maximize P = 3x1 +
7x2 subject to
x1 + x 2 ≥ 6
2x1 + x2 ≥ 5
x1 + 3x2 ≤ 15
x1 , x2 ≥ 0

(A) Introduce slack, surplus, and artificial variables and form the modified problem. (B) Write the
preliminary simplex tableau for the modified problem. (DO NOT SOLVE.)
Answer: (A)
Maximize P = 3x1 + 7x2 - Ma1 - Ma2
subject to
x1 + x2 - s1 + a 1 = 6
2x1 + x2 - s2 + a 2 = 5
x1 + 3x2 + s3 = 15
x1 , x2 , s1 , s2 , s3 , a 1 , a 2 ≥ 0

(B)
x1 x2 s1 s2 s3 a 1 a 2 P
1 1 -1 0 0 1 0 0 6
2 1 0 -1 0 0 1 0 5
1 3 0 0 1 0 0 0 15
-3 -7 0 0 0 M M 0
1
54) State whether the optimal solution has been found, an additional pivot is required, or there is no solution for
the
modified problem corresponding to the following simplex tableau:

x1 x2 x3 s1 a 1 s2 a2 a3 P
0 1 0 0 0 2 1 1 0 5
1 0 -1 0 1 -1 0 1 0 2
0 0 -3 1 2 1 -1 0 0 8
0 0 -M + 3 0 0 4M -5M + 2 1 20
Answer: There is no solution.

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

55) Solve the linear programming

problem.
Minimize C = 10x1 + 12x2 + 28x 3
subject to 4x1 + 2x2 + 3x 3 ≥ 20
3x1 - x2 - 4x3 ≤ 10
x1 , x2 , x3 ≥ 0
A) Min C = 64 at x1 = 4, x2 = 4, x3 = 2
B) Min C = 64 at x1 = 0, x2 = 2, x3 = 2
C) Min C = 64 at x1 = 0, x2 = 2, x3 = 4
D) Min C = 64 at x1 = 4, x2 = 2, x3 = 0
Answer: D

Solve the problem.

56) Formulate the following problem as a linear programming problem (DO NOT SOLVE):A shoe company is
introducing a new line of running shoes. The marketing division decides to promote the line in a particular
city. The promotion will consist of newspaper, radio, and television ads. Each newspaper ad will cost $120,
each television ad will cost $370, and each radio ad will cost $210. The company wants to spend at most
half their money on newspaper ads. The marketing division believes that each newspaper ad will reach
4,700 men and
3,700 women, each television ad will reach 7,600 men and 6,600 women, and each radio ad will reach 4,500
men and 5,500 women. The promotion will be considered successful if it reaches at least 400,000 men and
200,000 women. How should the company divide its money between the newspaper, television, and radio
ads so as to
insure a successful promotion at a minimum cost? (Let x1 equal the number of newspaper ads, x2
equal the number of television ads, and x3 equal the number of radio ads purchased in the promotion.)
A) Minimize C = -120x1 - 370x2 + 210x3
subject to
4,700x1 + 7,600x2 + 4,500x3 ≤

400,000
3,700x1 + 6,600x2 + 5,500x3 ≤

200,000
120x1 - 370x2 - 210x3 ≤

0
x1 , x2 , x3 ≥ 0
B) Maximize C = 120x1 + 370x2 + 210x3
subject to
4,700x1 + 7,600x2 + 4,500x3 ≥

400,000
3,700x1 + 6,600x2 + 5,500x3 ≥

200,000
120x1 - 370x2 - 210x3 ≤ 0
x1 , x2 , x3 ≥ 0
C) Minimize C = -120x1 - 370x2 + 210x3
subject to

32
4,700x1 + 7,600x2 + 4,500x3 ≥

400,000
3,700x1 + 6,600x2 + 5,500x3 ≥

200,000
120x1 - 370x2 - 210x3 ≤

0
x1 , x2 , x3 ≥ 0

33
 D) Minimize C = 120x1 + 370x2 + 210x3
subject to
4,700x1 + 7,600x2 + 4,500x3 ≥

400,000
3,700x1 + 6,600x2 + 5,500x3 ≥

200,000
120x1 - 370x2 - 210x3 ≤
Answer: D
0
x1 , x2 , x3 ≥ 0

57) A catering company makes three kinds of Jello salad orange, strawberry, and lemon. It supplies two outlet
stores, Outlet A and Outlet B. The company can make up to 14 trays of orange, 20 trays of strawberry, and 24
trays of lemon per day. Outlet A needs at least 20 trays of Jello per day and Outlet B needs at least 10 trays of
Jello per day. The transportation costs for shipping trays from the company to the outlets are given in the
chart
below:

Shipping Charges
Type of Jello Outlet A Outlet B
Orange $4 $1
Strawberry $1 $4
Lemon $5 $5

Formulate a linear programming problem that will determine a shipping schedule that will minimize the
cost of
transporting the Jello salads to fill the needs of the two outlets. DO NOT SOLVE.

Let x1 = number of trays of orange shipped to Outlet A

x2 = number of trays of strawberry shipped to Outlet A
x3 = number of trays of lemon shipped to Outlet A
x4 = number of trays of orange shipped to Outlet B
x5 = number of trays of strawberry shipped to Outlet B
x6 = number of trays of lemon shipped to Outlet B
A) Minimize C = 4x1 + x 2 + 5x3 + x4 + 4x5 + 5x6
subject to
x1 + x 4 ≤ 14
x2 + x 5 ≤ 20
x3 + x 6 ≤ 24
x 1 + x2 + x 3 ≥ 20
x4 + x5 + x6 10≥

x1 , x2 , x3 , x4 , x5 , x6 ≥ 0
B) Minimize C = -4x1 - x2 - 5x3 - x4 + 4x5 - 5x6
subject to
x1 + x 4 ≥ 14
x2 + x 5 ≥ 20
x3 + x6 ≤ 24
x1 + x2 + x3 ≥ 20
x 4 + x5 + x 6 ≥ 10
33
x1 , x2 , x3 , x4 , x5 , x6 ≥ 0

34
 C) Minimize C = -4x1 - x2 + 5x3 + x4 + 4x5 - 5x6
subject to
x1 + x 4 ≥ 14
x2 + x 5 ≥ 20
x3 + x 6 ≤ 24

x 1 + x2 + x 3 ≥ 20
x 4 + x5 + x 6 ≥ 10
x1 , x2 , x3 , x4 , x5 , x6 ≥ 0
D) Minimize C = -4x1 - x2 + 5x3 + x4 + 4x5 - 5x6
subject to
x1 + x 4 ≤ 14
x2 + x 5 ≤ 20
x3 + x 6 ≤ 24

x 1 + x2 + x 3 ≥ 20
x 4 + x5 + x 6 ≥ 10
x1 , x2 , x3 , x4 , x5 , x6 ≥ 0

Answer: A

58) Formulate the following problem as a linear programming problem (DO NOT SOLVE):A veterinarian
wants to
set up a special diet that will contain at least 500 units of vitamin B1 at least 800 units of vitamin B2 and at
least
700 units of vitamin B6 . She also wants to limit the diet to at most 300 total grams. There are three feed
mixes available, mix P, mix Q, and mix R. A gram of mix P contains 3 units of vitamin B1 , 5 units of
vitamin B2 , and 8 units of vitamin B6 . A gram of mix Q contains 9 units of vitamin B1 , 8 units of vitamin
B2 , and 6 units of vitamin B6 . A gram of mix R contains 7 units of vitamin B1 , 6 units of vitamin B2 , and 9
units of vitamin B6 . Mix P costs $0.10 per gram, mix Q costs $0.12 per gram, and mix R costs $0.21 per
gram. How many grams of each mix should the veterinarian use to satisfy the requirements of the diet at
minimal costs? (Let x1 equal the number of grams of mix P, x2 equal the number of grams of mix Q, and x 3
equal the number of grams of mix R that are used in the diet).
A) Minimize C = -0.10x 1 - 0.12x 2 - 0.21x 3
subject to
3x1 + 9x2 + 7x3 ≤ 500
5x1 + 8x2 + 6x3 ≤ 800
8x1 + 6x2 + 9x3 ≥ 700
x1 + x2 + x3 ≤ 300
x 1 , x 2 , x3 ≥ 0
B) Minimize C = 0.10x 1 + 0.12x 2 + 0.21x 3
subject to
3x1 + 9x2 + 7x3 ≥ 500
5x1 + 8x2 + 6x3 ≥ 800
8x1 + 6x2 + 9x3 ≥ 700
x1 + x2 + x3 ≤ 300
x 1 , x 2 , x3 ≥ 0

34
 C) Minimize C = 0.10x 1 - 0.12x 2 - 0.21x 3
subject to
3x1 + 9x2 + 7x3 ≤ 500
5x1 + 8x2 + 6x3 ≤ 800
8x1 + 6x2 + 9x3 ≥ 700
x1 + x2 + x3 ≤ 300
x 1 , x 2 , x3 ≥ 0
D) Minimize C = 0.10x 1 - 0.12x 2 + 0.21x 3
subject to
3x1 + 9x2 + 7x3 ≤ 500
5x1 + 8x2 + 6x3 ≥ 800
8x1 + 6x2 + 9x3 ≥ 700
x1 + x2 + x3 ≤ 300
x 1 , x 2 , x3 ≥ 0

Answer: B

35