Question 1

Using the enumeration approach, optimality is obtained by evaluating every coordinate.

Accepted Answer

A) True 
 B)False

Question 2

When we use less of a resource than was available, in linear programming that resource would be called non- __________.

Accepted Answer

A)  binding
B)  feasible
C)  reduced cost
D)  linear
E)  enumeratedF) B) and C)
G) B) and D)

Question 3

A linear programming problem can have multiple optimal solutions.

Accepted Answer

A) True 
 B)False

Question 4

Is the production combination 10 A's and 10 B's feasible?

Accepted Answer

The answer of Is the production combination 10 A's and...

Question 5

The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints.

Accepted Answer

A) True 
 B)False  False

Question 6

What is the objective function?

Accepted Answer

A)  $4 R + $6 S = Z
B)  $2 R + $3 S = Z
C)  $6 R + $4 S = Z
D)  $3 R + $2 S = Z
E)  $5 R + $5 S = ZF) A) and B)
G) A) and C)

Question 7

What is the optimum production combination and its profits?

Accepted Answer

The answer of What is the optimum production combination and...

Question 8

In linear programming, a non-zero reduced cost is associated with a:

Accepted Answer

A)  decision variable in the solution
B)  decision variable not in the solution
C)  constraint for which there is slack
D)  constraint for which there is surplus
E)  constraint for which there is no slack or surplusF) D) and E)
G) B) and E)

Question 9

For the production combination of 800 boxes of Deluxe and 600 boxes of Classic, which resource is slack (not fully used) ?

Accepted Answer

A)  sugar (only) 
B)  flour (only) 
C)  salt (only) 
D)  sugar and flour
E)  sugar and saltF) C) and D)
G) B) and C)

Question 10

Every change in the value of an objective function coefficient will lead to changes in the optimal solution.

Accepted Answer

A) True 
 B)False

Question 11

What is the sugar constraint (in tablespoons) ?

Accepted Answer

A)  6 B + 3 C  ≤\le≤  4,800
B)  1 B + 1 C  ≤\le≤  4,800
C)  2 B + 4 C  ≤\le≤  4,800
D)  4 B + 2 C  ≤\le≤  4,800
E)  2 B + 3 C  ≤\le≤  4,800 F) A) and B)
G) A) and C) C

Question 12

_________________ is a means of assessing the impact of changing parameters in a linear programming model.

Accepted Answer

A)  simulplex
B)  simplex
C)  slack
D)  surplus
E)  sensitivityF) A) and B)
G) C) and D) E

Question 13

What is the production time constraint (in minutes) ?

Accepted Answer

A)  2 R + 3 S  ≤\le≤  720
B)  2 R + 5 S  ≤\le≤  720
C)  3 R + 2 S  ≤\le≤  720
D)  3 R + 5 S  ≤\le≤  720
E)  5 R + 5 S  ≤\le≤  720 F) All of the above
G) A) and B)

Question 14

What is the maximum profit?

Accepted Answer

A)  $0
B)  $30,000
C)  $42,000
D)  $45,000
E)  $54,000F) C) and E)
G) B) and C)

Question 15

The term "range of feasibility" refers to coefficients of the objective function.

Accepted Answer

A) True 
 B)False

Question 16

What combination of x and y will provide a minimum for this problem?

Accepted Answer

A)  x = 0, y = 0
B)  x = 0, y = 3
C)  x = 0, y = 5
D)  x = 1, y = 2.5
E)  x = 6, y = 0F) A) and C)
G) A) and B)

Question 17

What is the storage space constraint?

Accepted Answer

A)  200K + 100Q  ≤\le≤  18,000
B)  200K + 90Q  ≤\le≤  18,000
C)  300K + 90Q  ≤\le≤  18,000
D)  500K + 100Q  ≤\le≤  18,000
E)  100K + 90Q  ≤\le≤  18,000 F) D) and E)
G) A) and B)

Question 18

Which of the following is not a feasible production combination?

Accepted Answer

A)  0 R & 0 S
B)  0 R & 240 S
C)  180 R & 120 S
D)  300 R & 0 S
E)  180 R & 240 SF) All of the above
G) A) and B)

Question 19

What is the slack (unused amount) for each resource for the optimum production combination?

Accepted Answer

S(I)= 0; S...

Question 20

In graphical linear programming, when the objective function is parallel to one of the binding constraints, then:

Accepted Answer

A)  the solution is sub-optimal
B)  multiple optimal solutions exist
C)  a single corner point solution exists
D)  no feasible solution exists
E)  the constraint must be changed or eliminatedF) None of the above
G) A) and B)

Exam 19: Linear Programming

Using the enumeration approach, optimality is obtained by evaluating every coordinate.

Correct AnswerverifiedShow Answer

When we use less of a resource than was available, in linear programming that resource would be called non- __________.

Correct AnswerverifiedShow Answer

A linear programming problem can have multiple optimal solutions.

Correct AnswerverifiedShow Answer

Is the production combination 10 A's and 10 B's feasible?

Correct AnswerverifiedShow Answer

The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints.

Correct AnswerverifiedFalse

What is the objective function?

Correct AnswerverifiedShow Answer

What is the optimum production combination and its profits?

Correct AnswerverifiedShow Answer

In linear programming, a non-zero reduced cost is associated with a:

Correct AnswerverifiedShow Answer

For the production combination of 800 boxes of Deluxe and 600 boxes of Classic, which resource is slack (not fully used) ?

Correct AnswerverifiedShow Answer

Every change in the value of an objective function coefficient will lead to changes in the optimal solution.

Correct AnswerverifiedShow Answer

What is the sugar constraint (in tablespoons) ?

Correct AnswerverifiedC

_________________ is a means of assessing the impact of changing parameters in a linear programming model.

Correct AnswerverifiedE

What is the production time constraint (in minutes) ?

Correct AnswerverifiedShow Answer

What is the maximum profit?

Correct AnswerverifiedShow Answer

The term "range of feasibility" refers to coefficients of the objective function.

Correct AnswerverifiedShow Answer

What combination of x and y will provide a minimum for this problem?

Correct AnswerverifiedShow Answer

What is the storage space constraint?

Correct AnswerverifiedShow Answer

Which of the following is not a feasible production combination?

Correct AnswerverifiedShow Answer

What is the slack (unused amount) for each resource for the optimum production combination?

Correct AnswerverifiedS(I)= 0; S...View AnswerShow Answer

In graphical linear programming, when the objective function is parallel to one of the binding constraints, then:

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
False

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
C

Correct Answer
verified
E

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
S(I)= 0; S...
View Answer

Correct Answer
verified