This preview shows pages 1–3. Sign up to view the full content.
11: INTEGER LINEAR PROGRAMMING
MULTIPLE CHOICE
1.
Which of the following is the most useful contribution of integer programming?
a.
finding whole number solutions where fractional solutions would not be appropriate
b.
using 01 variables for modeling flexibility
c.
increased ease of solution
d.
provision for solution procedures for transportation and assignment problems
2.
In a model, x
1
>
0 and integer, x
2
>
0, and x
3
= 0, 1.
Which solution would not be feasible?
a.
x
1
= 5, x
2
= 3, x
3
= 0
b.
x
1
= 4, x
2
= .389, x
3
= 1
c.
x
1
= 2, x
2
= 3, x
3
= .578
d.
x
1
= 0, x
2
= 8, x
3
= 0
3.
Rounded solutions to linear programs must be evaluated for
a.
feasibility and optimality.
b.
sensitivity and duality.
c.
relaxation and boundedness.
d.
each of the above is true.
4.
Rounding the solution of an LP Relaxation to the nearest integer values provides
a.
a feasible but not necessarily optimal integer solution.
b.
an integer solution that is optimal.
c.
an integer solution that might be neither feasible nor optimal.
d.
an infeasible solution.
5.
The solution to the LP Relaxation of a maximization integer linear program provides
a.
an upper bound for the value of the objective function.
b.
a lower bound for the value of the objective function.
c.
an upper bound for the value of the decision variables
d.
a lower bound for the value of the decision variables
6.
The graph of a problem that requires x
1
and x
2
to be integer has a feasible region
a.
the same as its LP relaxation.
b.
of dots.
c.
of horizontal stripes.
d.
of vertical stripes.
7.
The 01 variables in the fixed cost models correspond to
a.
a process for which a fixed cost occurs.
b.
the number of products produced.
c.
the number of units produced.
d.
the actual value of the fixed cost.
8.
Sensitivity analysis for integer linear programming
a.
can be provided only by computer.
b.
has precisely the same interpretation as that from linear programming.
c.
does not have the same interpretation and should be disregarded.
d.
is most useful for 0  1 models.
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document2
Chapter 11
Integer Linear Programming
9.
Let x
1
and x
2
be 0  1 variables whose values indicate whether projects 1 and 2 are not done or are done.
Which answer below indicates that project 2 can be done only if project 1 is done?
a.
x
1
+ x
2
= 1
b.
x
1
+ x
2
= 2
c.
x
1
 x
2
<
0
d.
x
1
 x
2
>
0
10.
Let x
1
, x
2
, and x
3
be 0  1 variables whose values indicate whether the projects are not done (0) or are
done (1).
Which answer below indicates that at least two of the projects must be done?
a.
x
1
+ x
2
+ x
3
>
2
b.
x
1
+ x
2
+ x
3
<
2
c.
x
1
+ x
2
+ x
3
= 2
d.
x
1
 x
2
= 0
11.
If the acceptance of project A is conditional on the acceptance of project B, and vice versa, the
appropriate constraint to use is a
a.
multiplechoice constraint.
b.
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '10
 ADMS3330

Click to edit the document details