CO 350 Assignment 4 – Winter 2010
Due: Friday February 5 at 10:25 a.m.
Solutions are due in drop box #9 (Section 1) or #10 (Section 2), outside MC 4066 by the due time.
Use the appropriate slot for your section and surname.
Please acknowledge all outside sources, as well as all collaboration, discussion, help,
etc., in your submission.
0.
Begin your assignment with the following:
Last Name:
(Print your last name.)
First Name:
(Print your “oﬃcial” ﬁrst name. No nicknames.)
ID:
(Print your UW student ID)
Section:
(Print your section number)
Acknowledgments:
1. Prove the following statements.
(a) The set of optimal solutions of a linear programming problem is a convex set.
(b) Either an LP problem has no optimal solution, or has exactly one optimal solution, or
has inﬁnitely many diﬀerent optimal solutions.
2. Let
x
*
be an element of a convex set
S
. Show that
x
*
is an extreme point of
S
if and only if
the set
S
\ {
x
*
}
is a convex set.
3. Let
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '10
 GUENIN
 Operations Research, Optimization, optimal solution, linear programming problem

Click to edit the document details