CO 350 Linear Optimization (Spring 2009)
Assignment 2
Section 1: Due at 1:00p.m. June 4, 2009 (Th) in MC1085, before the lecture starts
Section 2: Due at 10:30a.m. June 5, 2009 (F) in MC2065, before the lecture starts
Write your name, ID# and Section# clearly. NO
collaboration is allowed. The numbering of
the exercises refers to the April 2009 version of the course notes.
Policy for marking complaints
: If you have any complaints about the marking of assignments or
the midterm exam, then you should first check your solutions against the posted solutions. After that,
if you see any marking error, then you should return the assignment (or exam) to your instructor
within one week
and with written notes on all the marking errors; please write the notes on a new
sheet and attach it to the assignment/exam paper.
[10]
1.
Convert the following problem to standard equality form:
maximize
2
x
1
+
x
2
+
3
x
3
subject to
x
1
+
x
2
+
x
3
≥
2
x
1

x
2
=
1
x
1

x
3
≤
2
x
1
,
x
3
≥
0
.
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 '07
 S.Furino,B.Guenin
 Operations Research, Linear Programming, Optimization, Simplex algorithm, Polytope, COINOR

Click to edit the document details