Ops Homework 3

Up

For a minimization integer linear programming problem, a feasible solution is ensured by rounding ________ non-integer solution values if all of the constraints are the greater-than-or-equal-to type

x11 + x21 + x31 <= 250

If Xab = the production of product a in period b, then to indicate that the limit on production of the company's 3 products in period 1 is 250, we write:

x1 + x5 <= 1, x2 + x5 <= 1

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 situati

can sometimes

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

1

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:

False

The "certainty" linear programming (LP) hypothesis (LP are deterministic models) is violated by integer programming.

Exactly 3,5

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

False

The constraint x1 + x2 ≤ 1 is named as "conditional constraint" in 0-1 integer programming problems

False

The constraint x1 ≤ x2 is named as "mutually exclusive" constraint in 0-1 integer programming problems.

0.4x1 - 0.6x2 - 0.6x3 >= 0

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

The solution values are always integers

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

False

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