MAT 540 Week 9 Quiz 5

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

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

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

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.

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

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

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.

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

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

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

The linear programming relaxation contains the  _______ and the original constraints of the integer programming problem, but drops all integer restrictions.

Answer

The branch and bound method can only be used for maximization integer programming problems.
 

The solution value (Z)  to the linear programming relaxation of a minimization problem  will always be less than or equal to the optimal solution value (Z) of the integer programming minimization problem
 

The implicit enumeration method

Answer

Types of integer programming models are _____________.

In a 0 - 1 integer model, the solution values of the decision variables are 0 or 1.
 

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

Answer

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

Rounding small values of decision variables to the nearest integer value causes ______________ problems than rounding large values.

Answer

In using rounding of a linear programming model to obtain an integer solution, the solution is

Answer