This preview shows page 1. Sign up to view the full content.
CO350—Linear Optimization
Assignment 3
This assignment is due Friday, May 28, 2010, at 2 pm, in assignment drop box #2, in front of
MC4066. Please make sure that your full name, your student ID number, the course number, and
the name of your instructor are clearly visible on the front of your submission, and that all your
pages are securely stapled. You may discuss the assignment questions with other students, but you
must write your solutions up independently, and all submitted work must be your own.
1. Determine whether
b
x
= (1
,
1
,
1
,
3)
T
and
e
x
= (0
,
1
,
6
,
1)
T
are optimal solutions of this LP.
max
2
x
1

2
x
2
+
x
3
+ 2
x
4
s.t. 12
x
1
+
x
2
+ 2
x
3

x
4
= 12
7
x
1
+ 3
x
3
+ 4
x
4
= 22
3
x
1
+
x
2
+
x
3
+
x
4
= 8
x
1
,
x
2
,
x
3
,
x
4
≥
0
.
2. By using the complementary slackness conditions, determine for which values of
t
the feasible
solution
x
*
= (2
,
0
,
3
,
1)
T
is optimal for the following LP.
max 13
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '07
 S.Furino,B.Guenin

Click to edit the document details