Question 1

Decision variables a. tell how much or how many of something to produce, invest, purchase, hire, etc. b. represent the values of the constraints. c. measure the objective function. d. must exist for each constraint.

Question 2 Which of the following statements is NOT true? a. A feasible solution satisfies all constraints. b. An optimal solution satisfies all constraints. c. An infeasible solution violates all constraints. d. A feasible solution point does not have to lie on the boundary of the feasible region.

Question 3 A variable added to the left-hand side of a less-than-or-equal-to constraint to convert the constraint into an equality is a. a standard variable b. a slack variable c. a surplus variable d. a non-negative variable

Question 4 The LP Relaxation contains the objective function and constraints of the IP problem, but drops all integer restrictions. a. True b. False

Question 5 If the LP relaxation of an integer program has a feasible solution, then the integer program has a feasible solution. a. True b. False

BUSINESS DECISION ANALYSIS COURSE