Ops- Hw 3

In formulating a mixed integer programming problem, the constraint x1 + x2 ≤ 500y1 where y1 is a 0-1 variable and x1 and x2 are continuous variables, then x1 + x2 = 500 if y1 is:

1

Compared to blending and product mix problems, transportation problems are unique because:

the solution values are always integers

The constraint (x1 + x2 + x3 + x4 + x5 = 3) means that ________ out of the ________ projects must be selected

exactly 3 our of the 5

If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a mutually exclusive constraint.

False

In a 0-1 integer programming model, if the constraint x1 - x2 ≤ 0, it means when project 2 is selected, project 1 ________ be selected.

can sometimes

If we are solving a 0-1 integer programming problem, the constraint x1 + x2 ≤ 1 is a conditional constraint.

false

The "certainty" linear programming hypothesis is violated by integer programming.

false

The three types of integer programming models are total, 0-1, and binary.

false

In a "capital budgeting" problem, if either project 1 or project 2 is selected, then project 5 cannot be selected. Which of the alternatives listed below correctly models this situation?

x1 + x5 ≤ 1, x2 + x5 ≤ 1

Assume that x1, x2 and x3 are the dollars invested in three different common stocks from New York Stock Exchange. The investing company requires that more than 60% of the dollars invested should be in "stock 1". The constraint for this requirement can be written as:

0.4x1 - 0.6x2 - 0.6x3 ≥ 0