MGMT330
Sample Final Exam
Spring 2008
Time allowed 3 hours
Note: Answers to multiple choice are marked with an asterisk *
Questions 1 – 22 are based on LP
1.
Decision variables
a.
tell how much or how many of something to produce, invest, purchase, hire, etc.*
b.
represent the values of the constraints.
c.
measure the objective function.
d.
must exist for each constraint.
2.
A solution that satisfies all the constraints of a linear programming problem except the
nonnegativity constraints is called
a.
optimal.
b.
feasible.
c.
infeasible.*
d.
semifeasible.
3. Slack
4.
Which of the following special cases does not require reformulation of the problem in order to
obtain a solution?
5.
The improvement in the value of the objective function per unit increase in a righthand side is
the
6.
As long as the slope of the objective function stays between the slopes of the binding
constraints
a.
the value of the objective function won't change.
b.
there will be alternative optimal solutions.
c.
the values of the dual variables won't change.*
d.
there will be no slack in the solution.
1
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
7.
A constraint that does not affect the feasible region is a
8.
Whenever all the constraints in a linear program are expressed as equalities, the linear program
is said to be written in
9.
Only binding constraints form the shape (boundaries) of the feasible region. True or False?
10.The constraint 5x
1

2x
2
≤
0 passes through the point (20, 50).
True or False?
11.Alternative optimal solutions occur when there is no feasible solution to the problem.
T or F?
12.Because the dual price represents the improvement in the value of the optimal solution per unit
increase in righthand side, a dual price cannot be negative.
T or F?
13.No matter what value it has, each objective function line is parallel to every other objective
function line in a problem.
T or F?
14.If a decision variable is not positive in the optimal solution, its reduced cost is
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '09
 Management, Operations Research, Linear Programming, Optimization, Limit of a function, objective function, c. unboundedness

Click to edit the document details