Question 1

What combination of x and y will yield the optimum for this problem?

Accepted Answer

A)  x = 2, y = 0
B)  x = 0, y = 0
C)  x = 0, y = 3
D)  x = 1, y = 5
E)  none of the aboveF) B) and D)
G) B) and E)

Question 2

For the production combination of 135 Lite and 0 Dark which resource is "slack" (not fully used) ?

Accepted Answer

A)  time (only) 
B)  malt extract (only) 
C)  both time and malt extract
D)  neither time nor malt extract
E)  cannot be determined exactlyF) A) and C)
G) B) and E)

Question 3

For the purchase combination 0 King Beds and 200 Queen Beds, which resource is "slack" (not fully used) ?

Accepted Answer

A)  investment money (only) 
B)  storage space (only) 
C)  both investment money and storage space
D)  neither investment money nor storage space
E)  cannot be determined exactlyF) A) and C)
G) A) and D)

Question 4

A constraint that does not form a unique boundary of the feasible solution space is a:

Accepted Answer

A)  redundant constraint
B)  binding constraint
C)  non-binding constraint
D)  feasible solution constraint
E)  constraint that equals zeroF) None of the above
G) A) and D)

Question 5

What is the constraint for sugar?

Accepted Answer

A)  2 D + 3 C  ≤\le≤  4,800
B)  6 D + 8 C  ≤\le≤  4,800
C)  1 D + 2 C  ≤\le≤  4,800
D)  3 D + 2 C  ≤\le≤  4,800
E)  4 D + 5 C  ≤\le≤  4,800 F) A) and B)
G) All of the above

Question 6

The term "iso-profit" line means that all points on the line will yield the same profit.

Accepted Answer

A) True 
 B)False

Question 7

What is the objective function?

Accepted Answer

A)  $2 L + $3 D = Z
B)  $2 L + $4 D = Z
C)  $3 L + $2 D = Z
D)  $4 L + $2 D = Z
E)  $5 L + $3 D = ZF) All of the above
G) None of the above

Question 8

What are optimal daily profits?

Accepted Answer

A)  $0
B)  $240
C)  $420
D)  $405
E)  $505F) A) and E)
G) C) and D)

Question 9

It has been determined that, with respect to resource X, a one-unit increase in availability of X would lead to a $3.50 increase in the value of the objective function.This value would be X's _______.

Accepted Answer

A)  range of optimality
B)  shadow price
C)  range of feasibility
D)  slack
E)  surplusF) B) and D)
G) None of the above

Question 10

The theoretical limit on the number of decision variables that can be handled by the simplex method in a single problem is:

Accepted Answer

A)  1
B)  2
C)  3
D)  4
E)  unlimitedF) D) and E)
G) None of the above

Question 11

A change in the value of an objective function coefficient does not change the optimal solution.

Accepted Answer

A) True 
 B)False

Question 12

A shadow price indicates how much a one-unit decrease/increase in the right-hand side value of a constraint will decrease/increase the optimal value of the objective function.

Accepted Answer

A) True 
 B)False

Question 13

What is the objective function?

Accepted Answer

A)  $4.00 A + $1.00 B = Z
B)  $0.25 A + $1.00 B = Z
C)  $1.00 A + $4.00 B = Z
D)  $1.00 A + $1.00 B = Z
E)  $0.25 A + $0.50 B = ZF) C) and D)
G) A) and B)

Question 14

When a change in the value of an objective function coefficient remains within the range of optimality, the optimal solution would also remain the same.

Accepted Answer

A) True 
 B)False

Question 15

In graphical linear programming the objective function is:

Accepted Answer

A)  linear
B)  a family of parallel lines
C)  a family of iso-profit lines
D)  all of the above
E)  none of the aboveF) A) and B)
G) B) and C)

Question 16

Which of the following is not a feasible production combination?

Accepted Answer

A)  0 A & 0 B
B)  0 A & 400 B
C)  200 A & 300 B
D)  400 A & 0 B
E)  400 A & 400 BF) A) and B)
G) D) and E)

Question 17

Which of the following is not a feasible production combination?

Accepted Answer

A)  0 B & 0 C
B)  0 B & 1,100 C
C)  800 B & 600 C
D)  1,100 B & 0 C
E)  0 B & 1,400 CF) B) and D)
G) A) and D)

Question 18

What is the objective function?

Accepted Answer

A)  $0.50 D + $0.40 C = Z
B)  $0.20 D + $0.30 C = Z
C)  $0.40 D + $0.50 C = Z
D)  $0.10 D + $0.20 C = Z
E)  $0.60 D + $0.80 C = ZF) A) and E)
G) A) and D)

Question 19

Solve the following linear programming problem:

Accepted Answer

The answer of Solve the following linear programming problem: ...

Question 20

In the range of feasibility, the value of the shadow price remains constant.

Accepted Answer

A) True 
 B)False

Exam 19: Linear Programming

What is the objective function?

Correct AnswerverifiedShow Answer

A constraint that does not form a unique boundary of the feasible solution space is a:

Correct AnswerverifiedShow Answer

A shadow price indicates how much a one-unit decrease/increase in the right-hand side value of a constraint will decrease/increase the optimal value of the objective function.

Correct AnswerverifiedShow Answer

In the range of feasibility, the value of the shadow price remains constant.

Correct AnswerverifiedShow Answer

What is the objective function?

Correct AnswerverifiedShow Answer

What is the objective function?

Correct AnswerverifiedShow Answer

It has been determined that, with respect to resource X, a one-unit increase in availability of X would lead to a $3.50 increase in the value of the objective function.This value would be X's _______.

Correct AnswerverifiedShow Answer

Which of the following is not a feasible production combination?

Correct AnswerverifiedShow Answer

Which of the following is not a feasible production combination?

Correct AnswerverifiedShow Answer

When a change in the value of an objective function coefficient remains within the range of optimality, the optimal solution would also remain the same.

Correct AnswerverifiedShow Answer

Solve the following linear programming problem:

Correct AnswerverifiedShow Answer

A change in the value of an objective function coefficient does not change the optimal solution.

Correct AnswerverifiedShow Answer

What is the constraint for sugar?

Correct AnswerverifiedShow Answer

What are optimal daily profits?

Correct AnswerverifiedShow Answer

What combination of x and y will yield the optimum for this problem?

Correct AnswerverifiedShow Answer

The theoretical limit on the number of decision variables that can be handled by the simplex method in a single problem is:

Correct AnswerverifiedShow Answer

The term "iso-profit" line means that all points on the line will yield the same profit.

Correct AnswerverifiedShow Answer

In graphical linear programming the objective function is:

Correct AnswerverifiedShow Answer

For the production combination of 135 Lite and 0 Dark which resource is "slack" (not fully used) ?

Correct AnswerverifiedShow Answer

For the purchase combination 0 King Beds and 200 Queen Beds, which resource is "slack" (not fully used) ?

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified