Last Name, First Name:
TSquare ID
QUIZ #
8
FORM:
A
DATE:
10/13/2011
TODAY's QUESTIONs and Your Answers:
1
Consider the 0

1 integer programming problem below.
If we wish to add the
constraint that no more than two of these variables must be positive, how would
this be written?
X + Y + Z <= 2
1
1 point
2
An integer programming (maximization) problem was first solved as a linear
programming problem, and the 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 for the optimal integer solution to this
problem?
1
1 point
A) X = 12
Y = 32
B) X = 12
Y = 33
C) X = 12
D) Y = 32
E) None of the above
3
Graphically solve the
LP Relaxation
of the Integer Program problem listed
above.
What is the Optimal Solution?
X
1
=
5.5
X
2
=
3.5
1
1 point
4
Graphically solve the
Pure Integer Program
problem listed above.
What is
the Optimal Solution?
X
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '08
 CHANG
 Management, Operations Research, Linear Programming, Optimization, pure integer program, Integer Program problem

Click to edit the document details