# MKT500

## MKT500

Quiz 5
Question 1
2 out of 2 points

In a _______ integer model, some solution values for decision variables are integer and others can be non-integer.
Answer
Selected Answer:
mixed
Correct Answer:
mixed

Question 2
2 out of 2 points

In a total integer model, some solution values for decision variables are integer and others can be non-integer.

Answer
Selected Answer: False
Correct Answer: False

Question 3
2 out of 2 points

In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or rejection of the different projects.

Answer
Selected Answer: True
Correct Answer: True

Question 4
2 out of 2 points

If a maximization linear programming problem consist of all less-than-or-equal-to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients, then rounding down the linear programming optimal solution values of the decision variables will ______ result in a(n) _____ solution to the integer linear programming problem.
Answer
Selected Answer:
sometimes, optimal
Correct Answer:
sometimes, optimal

Question 5
2 out of 2 points

The branch and bound method of solving linear integer programming problems is an enumeration method.

Answer
Selected Answer: True
Correct Answer: True

Question 6
2 out of 2 points

In a mixed integer model, all decision variables have integer solution values.

Answer
Selected Answer: False
Correct Answer: False

Question 7
2 out of 2 points

For a maximization integer linear programming problem, feasible solution is ensured by rounding _______ non-integer solution values if all of the constraints are less-than -or equal- to type.
Answer
Selected Answer:
down
Correct Answer:
down

Question 8
2 out of 2 points

In a...