No.

Question Options Ans

the values of decision variables obtained by rounding

1.
off are always very close to the optimal values.

the values of decision variables obtained by rounding

2.
off are always very close to the optimal values.
Solving an integer programming problem by rounding off
answers obtained by solving it as a linear programming the value of the objective function for a maximization
1. 3
problem (using simplex) to values in the feasible region, 3. problem will likely be less than that for the simplex
we find that solution.

4. all constraints are satisfied exactly.

5. none of the above

1. Y ≥ X

2. Y ≤ X
As part of a larger problem, you are trying to determine
whether or not to open a plant with a capacity of 10,000
2. units (using binary variable Y). You also define X as the 4
3. X + Y ≥ 2
number of units (if any) produced at that plant. How will
you ensure that Y will equal 1 if the plant is open?

4. X ≤ 10000Y

5. X = 10000Y

1. X1 < 9

2. X1 >= 9
Suppose the branch and bound method is used to solve
an integer programming problem. When the linear
solution is found, X1 = 9.15. If branching is done on this
3. 4
variable, two branches would be generated. The 3. X1 <= 10
constraint X1 <= 9 is added to one branch. What
constraint would be added to the other branch?
4. X1 >= 10

5. none of the above

An integer programming (maximization) problem was

4. first solved as a linear programming problem, and the 1. X = 12 Y = 32 5
objective function value (profit) was $253.67. The two
 decision variables (X, Y) in the problem had values of X =
12.45 and Y = 32.75. Which of the following must be true 2. X = 12 Y = 33
for the optimal integer solution to this problem?

3. X = 12

4. Y = 33

5. none of the above

1. Alternative 4
The following is a payoff table giving profits for various
situations.

2. Alternative 3

5. 2
3. Alternative 2

4. Alternative 1

What decision would an optimist make?

5. State of Nature A

1. a mixed-integer programming problem.

2. a zero-one integer programming problem.

6. A assignment problem is an example of 2

3. a pure-integer programming problem.

4. a goal programming problem.

5. a nonlinear programming problem.

Consider the following 0-1 integer programming problem:

1. X + Y + Z ≤ 3, Y + Z ≤1
Minimize 20X +36Y + 24Z
7. Subject to: 2X + 4Y + 3Z ≥ 7 2
12X + 8Y + 10Z ≥ 25
X, Y, Z must be 0 or 1 2. X = 1, Y + Z ≤1
 If we wish to add the constraint that X must be positive,
and that only Y or Z but not both can be positive, how 3. X ≤ 2, and Y ≤ 2, and Z ≤ 2
would the additional constraint(s) be written?

4. X ≤1, Y + Z = 1

5. none of the above

Job (Time in 1. worker A

Table A
Minutes)

1 2 3 4
2. worker C
Worker A 0 0 2 1

B 1 3 1 0
8. 1
3. either worker A or worker C
C 1 0 1 1

D 0 1 0 3
4. neither worker A nor worker C

Given Table A, the final table for an assignment problem, 5. worker D

who should be assigned to job 1?

1. the smallest uncovered number is added to all zeros.

the smallest uncovered number is added to all

2.
uncovered numbers.

In revising the opportunity cost table of the assignment

9. the smallest uncovered number is added to all 3
problem, after drawing lines through all of the zeros 3.
numbers at the intersection of lines.

4. all of the above

5. -

1. agent 3 can be assigned to 2 tasks.

The assignment problem constraint x31 + x32 + x33 +

10. 2. agent 3 can be assigned to 3 tasks. 2
x34 < 3 means

a mixture of agents 1, 2, 3, and 4 will be assigned to

3.
tasks.
 4. there is no feasible solution.

5. -

1. is always measured in profit.

2. is always measured in cost.

11. A payoff 4
3. exists for each state of nature.

exists for each pair of decision alternative and state of

4.
nature.

5. -

1. how sensitive the decision maker is to risk.

2. changes in the available alternatives.

12. Sensitivity analysis considers 4

3. changes in the number of states of nature.

4. changes in the values of the payoffs.

5. -

Assume that you are to solve the minimization

assignment problem depicted in Table 11-5 using the 1. 19
branch and bound method. With what lower bound would
you begin?
Job (Time
Table 11-5
in 2. 18

13. Minutes) 4

1 2 3 4 3. 17

Worker A 5 9 5 7

4. 16
B 3 8 4 4
 C 5 5 8 4
5. 20
D 7 4 5 5

1. must connect every node to a transshipment node.

2. represent the cost of shipments.

14. Arcs in a transshipment problem 3

3. indicate the direction of the flow.

4. All of the alternatives are correct.

5. -

1. correspond to arcs.

2. include a variable for every arc.

15. Constraints in a transshipment problem require the sum of the shipments out of an origin node 2
3.
to equal supply.

4. All of the alternatives are correct.

5. -

1. costs appear in the objective function only

2. the RHS of all constraints is 1

Which of the following is not a characteristic of

16. 4
assignment problems? 3. the value of all decision variables is either 0 or 1

4. the signs of constraints are always ≤

5. -
 1. requires probabilities for all states of nature.

requires a clear understanding of decision alternatives,

2.
states of nature, and payoffs.

17. Making a good decision 2

3. implies that a desirable outcome will occur.

4. All of the alternatives are true.

5. -

1. use the dual prices very cautiously.

2. make multiple computer runs.

To perform sensitivity analysis involving an integer linear

18. use the same approach as you would for a linear 2
program, it is recommended to 3.
program.

4. use LP relaxation.

5. -

1. 2X + 2Y + 2Z ≤3

Consider the following 0-1 integer programming problem 2. X + Y + Z ≤ 2

Maximize 20X +36Y + 24Z
Subject to: 2X + 4Y + 3Z ≤ 7
12X + 8Y + 10Z ≤ 25
19. 2
X, Y, Z must be 0 or 1 3. X ≤ 2, and Y ≤ 2, and Z ≤ 2
If we wish to add the constraint that no more than two of
these variables may be positive, how would this be
written?
4. 2 ≤ 3

5. none of the above

An integer programming (minimization) problem was first

20. solved as a linear programming problem, and the 1. X = 13 Y = 33 4
objective function value (cost) was $253.67. The two
 decision variables (X, Y) in the problem had values of X =
12.45 and Y = 32.75. Which of the following must be true 2. X = 12 Y = 32
for the optimal integer solution to this problem?

3. the objective function value must be less than $253.67

the objective function value will be greater than

4.
$253.67

5. none of the above

The following is a payoff table giving profits for various

situations. 1. Alternative 1
States of
Nature

Alternatives A B C 2. Alternative 2

Alternative 1 120 140 120

21. 1
3. Alternative 3
Alternative 2 200 100 50

Alternative 3 100 120 180

4. Do Nothing
Do Nothing 0 0 0

What decision would a pessimist make? 5. none of the above

The following is an opportunity loss table. 1. Alternative 1

States of
Nature

Alternatives A B C 2. Alternative 2

Alternative 1 30 0 10
22. 2
3. Alternative 3
Alternative 2 5 20 0

Alternative 3 0 20 25
4. State of Nature C
What decision should be made based on the minimax
regret criterion?
5. none of the above

Given Table X, the final table for an assignment problem,

which worker should be assigned to job 2? 1. Person A
Job (Time in
23. Table X 5
Minutes)

1 2 3 4 2. Person D
Worker A 0 0 2 1
3. Either person A or person C
B 1 3 1 0

C 1 0 1 1
4. Neither person A nor person C
D 0 1 0 3

5. Person C