Multiple Choice Questions:

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

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 eliminated

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

A. x = 0.5, y = 5.0

B. x = 0.0, y = 4.0

C. x = 2.0, y = 5.0

D. x = 1.0, y = 2.0

E. x = 2.0, y = 1.0

3. Combination of x and y will provide a minimum for this problem?

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 = 0

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

A. 1

B. 2

C. 3

D. 4

E. unlimited

5. The theoretical limit on the number of constraints that can be handled by the simple method in a single problem is:

A. 1

B. 2

C. 3

D. 4

E. unlimited

6. A shadow price reflects which of the following in a maximization problem?

A. marginal cost of adding additional resources

B. marginal gain in the objective that would be realized by adding one unit of a resource

C. net gain in the objective that would be realized by adding one unit of a resource

D. marginal gain in the objective that would be realized by subtracting one unit of a resource

E. expected value of perfect information