This preview shows pages 1–2. Sign up to view the full content.
CO 350 Assignment 8 – Winter 2009
Due: Monday March 30 at 10 a.m.
Solutions are due in
drop box #2
, outside MC 4066 by the due time:
Slot #9 (AF), Slot #10 (GL), Slot #11 (MR), Slot #12 (SZ).
Write your name, ID# and Section# clearly.
Marks will be deducted if any of this info is missing or incorrect.
Section 1: J. Cheriyan, TTh 1011:20 a.m.
Section 2: E. Teske, MWF 10:3011:20 a.m.
Please acknowledge all outside sources, help and collaboration in your submission.
Policy for marking complaints
: If you have any complaints about the marking of assignments or the
midterm exam, then you should ±rst 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; you may write the notes on the
±rst/last page or else attach a separate sheet.
(
⋆
) Reading
:
Read Chapters 10 and 11, before attempting the exercises.
1. Consider the linear programming problem
(
P
)
max
{
c
T
x
:
Ax
=
b, x
≥
0
}
,
where
c
T
=
b
0
,

1
,
2
,
1
,
2
B
,
A
=
2

1
5

4

1

1
1
1

1
0
1
2

1
1
1
,
and
b
=
4
2
10
.
Given
B
=
{
3
,
4
,
5
}
is a feasible basis.
(Note: Parts (d) to (i) are independent of each other.)
(a) Find the basic solution
x
*
determined by basis
B
.
(b) Find the solution
y
of
A
T
B
y
=
c
B
.
(c) Compute ¯
c
1
and ¯
c
2
and show that
x
*
is an optimal solution.
(d) Suppose that
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.
This note was uploaded on 02/05/2010 for the course CO 350 taught by Professor S.furino,b.guenin during the Spring '07 term at Waterloo.
 Spring '07
 S.Furino,B.Guenin

Click to edit the document details