Ops Ch 5 T/F
T/F: A conditional constraint specifies the conditions under which variables are integers or real variables.
F
T/F: Rounding non-integer solution values up to the nearest integer value will result in an infeasible solution to an integer linear programming problem.
F
T/F: In a 0-1 integer model, the solution values of the decision variables are 0 or 1.
T
T/F: If we are solving a 0-1 integer programming problem, the constraint x1 + x2 = 1 is a mutually exclusive constraint.
F
T/F: If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a conditional constraint.
F
T/F: If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a mutually exclusive constraint.
F
T/F: In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 cannot be selected.
F
T/F: In a mixed integer model, all decision variables have integer solution values.
F
T/F: In a mixed integer model, the solution values of the decision variables are 0 or 1.
F
T/F: In the classic game showPassword, the suave, silver-haired host informed the contestants, "you can choose to pass or to play." This expression suggests a mixed integer model is most appropriate.
F
T/F: The branch and bound solution method cannot be applied to 0-1 integer programming problems.
F
T/F: The management scientist's fiance informed him that if they were to be married, he would also have to welcome her mother into their home. The management scientist should model this decision as a contingency constraint.
F
T/F: A feasible solution to an integer programming problem is ensured by rounding down non-integer solution values.
T
T/F: If we are solving a 0-1 integer programming problem, the constraint x1 + x2 ≤ 1 is a mutually exclusive constraint.
T
T/F: If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a conditional constraint.
T
T/F: In a mixed integer model, some solution values for decision variables are integer and others can be non-integer.
T
T/F: In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or rejection of the different projects.
T
T/F: In a total integer model, all decision variables have integer solution values.
T
T/F: One type of constraint in an integer program is a multiple-choice constraint.
T
T/F: Rounding non-integer solution values up to the nearest integer value can result in an infeasible solution to an integer programming problem.
T
T/F: The college dean is deciding among three equally qualified candidates for his associate dean position. If this situation can be modeled as an integer program, the decision variables would be cast as 0-1 integer variables.
T
T/F: The divisibility assumption is violated by integer programming.
T
T/F: The production planner for Airbus showed his boss the latest product mix suggestion from their slick new linear programming model: 12.5 model 320s and 17.4 model 340s. The boss looked over his glasses at the production planner and reminded him that they had several half airplanes from last year's production rusting in the parking lot. No one, it seems, is interested in half of an airplane. The production planner whipped out his red pen and crossed out the .5 and .4, turning the new plan into 12 model 320s and 17 model 340s. This production plan is definitely feasible.
T
T/F: The three types of integer programming models are total, 0-01, and mixed.
T
