Self Study Practice Problems

________ techniques assume that no uncertainty exists in model parameters.

A) Probability

B) Probabilistic

C) Deterministic

D) Distribution

Which of the following special cases does not require reformulation of the problem in order to obtain a solution?

A) unboundedness

B) infeasibility

C) alternate optimality

D) Each one of these cases requires reformulation.

Multiple optimal solutions can occur when the objective function is ________ a constraint line.

A) unequal to

B) equal to

C) perpendicular to

D) parallel to

The theoretical limit on the number of constraints that can be handled by a linear programming problem is:

A) 2.

B) 3.

C) 4.

D) unlimited.

The management scientist constructed a linear program to help the alchemist maximize his gold production process. The computer model chugged away for a few minutes and returned an answer of infinite profit, which is what might be expected from a(n) ________ problem.

If we are solving a 0-1 integer programming problem, the constraint x1 + x2 1 is a ________ constraint.

A) mutually exclusive

B) multiple-choice

C) conditional

D) corequisite

In a 0-1 integer programming model, if the constraint x1 - x2 = 0, it means when project 1 is selected, project 2 ________ be selected.

A) can also

B) can sometimes

C) can never

D) must also

In a 0-1 integer programming model, if the constraint x1 - x2 0, it means when project 2 is selected, project 1 ________ be selected.

A) must always

B) can sometimes

C) can never

D) is already