In a binary integer programming problem when a decision variable x = 1 corresponds to a “yes” decision and x = 0 to a “no” decision, which of the following formulates the condition that 3 alternatives (represented by decision variables x1, x2 and x3) are mutually exclusive?Group of answer choicesx1 + x2 + x3 >= 1x1 + x2 + x3 <= 2x1 + x2 + x3 = 1x1 + x2 + x3 <= 1

In a BIP problem with 2 mutually exclusive alternatives, x1 and x2, the following constraintneeds to be added to the formulation if one alternative must be chosen:A) x1 + x2 ≤ 1.B) x1 + x2 = 1.C) x1 − x2 ≤ 1.D) x1− x2 = 1.E) None of the choices is correct.

The three types of integer programming models are total, 0-1, and mixed.Group of answer choicesTrueFalse

Nonnegativity constraints ensure that _____.Group of answer choicesthe solution to the problem will contain only nonnegative values for the decision variablesthere are no inequalities in the constraintsthe problem modeling includes only nonnegative values in the constraintsthe objective function of the problem always returns maximum quantities PreviousNext

Assuming W1 and W2 are 0-1 integer variables indicating whether projects 1 and 2 are selected, respectively, the constraint W1 + W2 <= 1 means thatGroup of answer choicesthe projects are mutually exclusiveproject 1 is conditional on project 2project 2 is conditional on project 1none of the above.

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