IOE310
Midterm Exam
February 21, 2007
Name:______________________________________________________________
Instructions
•
This is a closed book, closed notes exam
.
•
You may use one double sided 8by11 “
note sheet
” and
calculator
during the exam.
•
There are
four
problems in the exam and
12
pages (including this). You can use the
back of each sheet for your rough calculations.
•
Please write your solutions to each problem in this exam book. Show all work and write
legibly. Your grade will depend in part on the completeness and clarity of your
answers.
•
Sign your name below the Honor Pledge.
Instructors are not required to grade tests in
which the signed Honor Pledge does not appear
.
Good luck!
Honor Pledge:
“
I have neither given nor received aid on this examination
”
Signed:__________________________________________
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Problem 1 (
15 points
)
Part 1)
For each of the following statements, determine whether it is true or false and
explain why:
a)
(3
points
) If you pivot from one basic feasible solution to another in the
simplex algorithm and your objective value does not improve, then your current
solution must be optimal.
Answer (T/F):
Reason:
b)
(3
points
) Suppose you are solving a linear programming problem using
simplex method. If in a given iteration, a variable leaves the basis, then that
specific variable will not enter the basis in the succeeding iterations.
Answer (T/F):
Reason:
c)
(3
points
) Suppose you are solving a linear programming problem using
simplex method. If in a given tableau, one of the slack/surplus variables is among
the basic variables and has a nonzero value, then the current solution is not
optimal.
Answer (T/F):
This is the end of the preview.
Sign up
to
access the rest of the document.
 Winter '08
 Saigal
 Operations Research, Linear Programming, Optimization, Simplex algorithm, linear program

Click to edit the document details