Pregunta 12 2 pts In a mixed integer model, all decision variables have integer solution values. True False Pregunta 13 2 pts In a 0-1 integer programming model involving the selection of different projects (where xi - 1, if project iis selected, x = 0, otherwise), the constraint X1 - X2 implies that if project 2 is selected, project 1 cannot be selected. True False Pregunta 14 2 pts The divisibility assumption of linear programming does not apply for integer programming models. True False Pregunta 15 2 pts A multiple-choice constraint is a type of constraint that can be modelled in an integer programming model using 0-1 variables. True False Pregunta 16 2 pts A conditional constraint specifies the conditions under which variables are integers or real variables. True False Pregunta 17 2 pts If we are solving a 0-1 integer programming problem, the constraint X1 + X2 3 1 is a mutually exclusive constraint. True False Pregunta 18 2 pts If we are solving a 0-1 integer programming problem, the constraint x1 + x2 = 1 is a mutually exclusive constraint. True False Pregunta 19 2 pts If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a conditional constraint. True False Pregunta 20 2 pts The key to sensitivity analysis is the identification of the optimal corner point and the constraints forming it. This is true only for objective function coefficients. True False Olt depends on whether the problem is for maximization or minimization