1
OSCM 230
MIDTERM EXAM B (Key)
SPRING 2011
PROFESSOR DONG
1 Hour and 20 Minutes
NAME_________________
Question
Score
True/False (10 pts)
Multiple Choice(10 pts)
1.
Excel
(10 pts)
2.
LP Formulation
(18 pts)
3.
LP Formulation
(12 pts)
4. Integer LP Formulation
(15 pts)
5. Sensitivity)
(25 pts)
Bonus
(2 pts)
Total

This ** preview** has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
2
True/False (10 pts)
1.
A convex programming model should have an objective of maximizing the value of a convex
function.
True
False
2.
In LP, if the change of the right hand side constant is within the allowable range for that constraint,
then the optimal solution will not change.
True
False
3.
As long as a solution satisfies one constraint in a linear programming problem it is called a feasible
solution of the problem.
True
False
4.
A nice property of the quadratic programming model is that the local maximal is also the global
maximal.
True
False
5.
For a cost minimization integer linear programming problem, the objective function value of its LP
relaxation always provides a lower bound on the objective function value of the original problem.
True
False
Multiple choices (10 pts)
1.
Which of the statements below is false?
a.
Integer linear programming problems are harder to solve than linear programming problems.
b.
Quadratic programming models have linear constraints.
c.
Solver will not generate a sensitivity report for a linear programming model with integer
constraints
d.
Solver uses complete enumeration to find the optimal solution of an integer linear
programming model.
e.
Both a and b.
2.
Project 3
can be selected only if both
Projects 1 and 2 are selected, but if both Projects 1 and 2 are
selected, Project 3 doesn’t have to be selected. The appropriate expression for this constraint would
be
a.
x
3
≥
x
1
+
x
2