# Multiple choice questions on integer programming

True or False

1. The 3 types of integer programming models are total, 0 - 1, and mixed.

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

3. A rounded-down integer solution can result in a more than optimal solution to an integer programming problem.

4. If we are solving a 0-1 integer programming problem, the constraint x1 + x2 = 1 is a mutually exclusive constraint.

5. A rounded-down integer solution can result in a less than optimal solution to an integer programming problem.

Multiple choice

6. Types of integer programming models are _____________.

a. total

b. 0 - 1

c. mixed

d. all of the above

7. Which of the following is not an integer linear programming problem?

a. pure integer

b. mixed integer

c. 0-1integer

d. Continuous

8. If x1 + x2 is less than or equal to 500y1 and y1 is 0-1, then x1 and x2 will be _______________ if y1 is 0.

a. equal to 0

b. less than 0

c. more than 0

d. equal to 500

9. 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 an optimal solution to the integer linear programming problem.

a. always

b. sometimes

c. never

10. If the optimal solution to the linear programming relaxation problem is integer, it is ____________ to the integer linear programming problem.

a. a real solution

b. a degenerate solution

c. an infeasible solution

d. the optimal solution

e. a feasible solution

#### Solution Preview

True or False

1. The 3 types of integer programming models are total, 0 - 1, and mixed.

TRUE

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

FALSE

Only some decision variables have integer solution values.

3. A rounded-down integer solution can result in a more than optimal solution to an integer programming problem.

FALSE

A rounded-down integer solution can at best be the optimal solution to an integer programming problem.

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

#### Solution Summary

The solution provides answers and explnations to multiple choice questions on integer programming