Question 1

Consider the following linear programming problem:  Solve the values of x and y that will maximize revenue.What revenue will result?

Accepted Answer

x = 0, y =...

Question 2

A maximization problem may be characterized by all greater than or equal to constraints.

Accepted Answer

A) True 
 B)False

Question 3

What is the Columbia bean constraint?

Accepted Answer

A)  1 A + 2 B  ≤\le≤  4,800
B)  12 A + 8 B  ≤\le≤  4,800
C)  2 A + 1 B ≤\le≤ 4,800
D)  8 A + 12 B  ≤\le≤  4,800
E)  4 A + 8 B  ≤\le≤  4,800

Question 4

Once we go beyond two decision variables, typically the ___________ method of linear programming must be used.

Accepted Answer

A)  simplicit
B)  unidimensional
C)  simplex
D)  dynamic
E)  exponential

Question 5

For the constraints given below, which point is in the feasible solution space of this maximization problem?

Accepted Answer

A)  x = 1, y = 5
B)  x = -1, y = 1
C)  x = 4, y = 4
D)  x = 2, y = 1
E)  x = 2, y = 8

Exam 19: Linear Programming

For the constraints given below, which point is in the feasible solution space of this maximization problem?