ECON 3300 Exam 3

________ variables are best suited to be the decision variables when dealing with yes-or-no decisions.

0-1

In a ________ integer model, some solution values for decision variables are integers and others can be non-integer. A) total B) 0-1 C) mixed D) total, 0-1, and mixed

C.

In Excel, a binary constraint in cell A1 is created using the =BIN($A$1) formula.

False

In a mixed integer model, the solution values of the decision variables are 0 or 1.

False

The branch and bound solution method cannot be applied to 0-1 integer programming problems.

False

If we are solving a 0-1 integer programming problem, the constraint x1 + x2 = 1 is a(n) ________ constraint.

Multiple-Choice

Integer constraints are entered in the inequality dialog box within Excel's Solver routine.

True

One type of constraint in an integer program is a multiple-choice constraint.

True

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

True

Rounding a noninteger solution ________ to the nearest integer value will likely result in an infeasible solution.

Up

Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj = 1 if project j is selected and xj = 0, otherwise. The constraint (x1 + x2 + x3 + x4 = 2) means that ________ out of the ________ projects must be selected. A) exactly 1, 2 B) exactly 2, 4 C) at least 2, 4 D) at most 1, 2

B.

If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is: A) always optimal and feasible. B) sometimes optimal and feasible. C) always feasible. D) never optimal and feasible.

B.

In a ________ integer model, the solution values of the decision variables are 0 or 1. A) total B) 0-1 C) mixed D) total, 0-1, and mixed

B.

If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a ________ constraint. A) multiple-choice B) mutually exclusive C) conditional D) corequisite

C.

When systematically formulating a linear program, the first step is to: A) construct the objective function. B) formulate the constraints. C) identify the decision variables. D) identify the parameter values.

C.

If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a(n) ________ constraint.

Conditional

In a 0-1 integer programming model, if the constraint x1 - x2 = 0, it means when project 1 is selected, project 2 ________ be selected. A) can also B) can sometimes C) can never D) must also

D.

Which of the following is not an integer linear programming problem? A) pure integer B) mixed integer C) 0-1 integer D) continuous

D.

A mixed integer program has only integers as a solution; they are simply mixed, as opposed to an integer program where they are specific to the decision variables.

False

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

False

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

False

A(n) ________ integer model allows for the possibility that some decision variables are not integers.

Mixed

In choosing four electives from the dazzling array offered by the Decision Sciences Department next semester, the students that had already taken the management science class were able to craft a model using a(n) ________ constraint.

Multiple-Choice

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

Mutually Exclusive

Determining the production quantities of different products manufactured by a company based on resource constraints is a product mix linear programming problem.

True

In a mixed integer model, some solution values for decision variables are integer and others can be non-integer.

True

In a total integer model, all decision variables have integer solution values.

True

Rounding non-integer solution values up to the nearest integer value can result in an infeasible solution to an integer programming problem.

True

The divisibility assumption is violated by integer programming.

True

The feasible region in an integer programming graph is composed of a lattice of points.

True

In an integer program, if we were choosing between two locations to build a facility, this would be written as: ________.

x1 + x2 = 1

In an integer program, if building one facility required the construction of another type of facility, this would be written as:

x1 = x2