* MAT 540 In a mixed integer model, some solution values for decision variables are integer and others - $7.29*

Solution for the Following: | Rounding small values of decision variables to the nearest integer value causes ______________ problems than rounding large values. similar more fewer none of the above
In a mixed integer model, some solution values for decision variables are integer and others can be non-integer. True False
The branch and bound method of solving linear integer programming problems is ________________. an integer method a relaxation method a graphical solution an enumeration method
Types of integer programming models are _____________. total 0 - 1 mixed all of the above
The 3 types of integer programming models are total, 0 - 1, and mixed. True False
Which of the following is not an integer linear programming problem? pure integer mixed integer 0-1 integer continuous
The branch and bound method of solving linear integer programming problems is an enumeration method. True False
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 True False
In using rounding of a linear programming model to obtain an integer solution, the solution is always optimal and feasible sometimes optimal and feasible always optimal always feasible never optimal and feasible
In a total integer model, some solution values for decision variables are integer and others can be non-integer. True False
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. up and down up down up or down
In a 0 - 1 integer model, the solution values of the decision variables are 0 or 1. True False
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. always, optimal always, non-optimal never, non-optimal sometimes, optimal never, optimal
In a mixed integer model, all decision variables have integer solution values. True False
In a total integer model, all decision variables have integer solution values. True False
In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or rejection of the different projects. True False
In a _______ integer model, some solution values for decision variables are integer and others can be non-integer. total 0 - 1 mixed all of the above
The implicit enumeration method generates an optimal integer solution when no new constraints can be added to the relaxed linear programming model eliminates obviously infeasible solutions and evaluates the remaining solutions to determine which one is optimal is used to solve a mixed integer linear programming model cannot be used to solve linear programming models with multiple infeasible solutions
The branch and bound method can only be used for maximization integer programming problems. True False
The linear programming relaxation contains the _______ and the original constraints of the integer programming problem, but drops all integer restrictions. different variables slack values objective function decision variables surplus variables |

Filename: | M000030.pdf |

Filesize: |
324.17 kB |