\documentstyle[11pt]{article}
\begin{document}

\begin{center}
{\large\bf  C\&O 350 \\ 
  {\bf    Linear Programming (Winter/96)
}}
\end{center}


    \begin{tabular}{|l|c|c|}   \hline
 Lecturer: & Bill Cunningham  & Henry Wolkowicz \\
Sections:&2 & 1 \\
     Course Times:&TR 10:00-11:30&TR 1--2:30  \\
     Course Room:&MC2036 & E1 1501 \\
       Office: &MC5033A&       MC6065 \\
       Office Hours: & M 1--2, WTh 2--3  &M 2--3, Th 3--4 \\
       Phone: & x4627 &  x5589 \\
       Email: &  whcunnin@math &  henry@orion \\
       \hline
       \hline
    \end{tabular}

~~\\
~~\\
    \begin{tabular}{|l||c|c|c|c|}   \hline
 TA: &Troy Vasiga& Alan Ling  & Graeme Hepworth & Matthew Becker  \\
     Section:&1& 1& 2 & 2 \\
       Office: &MC4008& MC5164 & MC5136A  & MC4008   \\
       Office Hrs: &M 11-12   &T2:30-3:30 &T9-10,W3-4 &W11-12  \\
       Phone: &5917& x6673 &  x5334 &x5917 \\
    Email: &tmjvasiga@& chaling@&  ga2hepworth@& mwbecker@\\
& barrow&barrow&barrow&barrow\\
       \hline
    \end{tabular}
\begin{description}
  \item[ Text :]~ Chvatal, {\it Linear Programming}, Freeman, New York, 1983.  

  \item[ Prerequisites :]
       Math 235, Linear Algebra
     \item[  Course Rationale:]~~
The aim of this course is to understand the basic
principles and theory of linear programming.

  \item[ Grading:]
     10 percent assignments; 25 percent midterm; 65 percent final.\\
%A passing grade in the final exam is required to pass the course.\\
 A missed assignment or midterm will be treated as a mark of zero
unless the cause is illness (medical documentation required), or similar
good reason given promptly in writing, in which case the corresponding
weight will normally be transferred to the final exam.
\item[Midterm:]
        Thursday, February 15, 7--9 p.m. in rooms E1 1501, 2527, 3516, and
3518.  
Students having a conflict can write the exam
on the same day 5--7 p.m., in MC4021. Such students must obtain permission
in advance from their instructor.
  \item[Assignments:]
      There will  be approximately 5 assignments. 
The assignments are due on the stated date {\bf at
the beginning of class}
 unless another arrangement has been made with
the instructor {\bf in advance}.


\item[Tests:]
     The tests will cover the basic material covered in the lectures.
It is important to know and understand the definitions and theorems,
and to be able to derive simple consequences of them, as well as to 
be able to apply the algorithms.
It is extremely important to attend classes, since some of the material
will differ from the text. 

\item[Topics covered:]
The topics covered will include most of chapters 
1, 2, 3, 5,7,8,9,10 of the text. This includes
material on the revised simplex method, methods for solving general LPs,
duals of general LPs (including complementary slackness conditions),
theorems of the
Farkas lemma type, sensitivity  analysis. There will also be additional
material on integer programming and interior point methods, if time 
permits. Knowledge of first year linear algebra is crucial to this course.
Although the text does not assume linear algebra for the first few chapters, 
the lectures will. We will be giving a somewhat different view of the 
material, emphasizing its connections with linear algebra. DO NOT be tricked
into thinking that you do not need linear algebra because this part of 
the text manages (with great difficulty) to do some things without it.




\item[ Computing:]~~
  For some parts of the course the matrix computation
package MATLAB will be used.  It is available on undergrad.math.  If you
have never logged on to your undergrad.math account, you should get your
password by taking identification to MC 3011.



%  \item[ Additional References:]~~~  
%\begin{enumerate}
%\item
%G.B. Dantzig (1963) "Linear Programming and Extensions"
%       This is the  classical text on LP. 
%When our text by Chvatal appeared, several reviewers stated that it
%is the first book with a solid contribution since Dantzig's book.
%\item
%S.I. Gass  (1975) "Linear Programming"
%
%\item
%R.I. Rothenberg (1979) "Linear Programming"
%
%\item
%D.G. Luenberger (1984) "Linear and Nonlinear Programming"
%       Good insights and explanations for duality theory. In particular,
%see the interpretation of duality theory for the diet problem.
%
%\item
%K.G. Murty (1983)  "LINEAR PROGRAMMING"
%      This is the encyclopedia of books on linear programming - that is
%the reason for the caps in the title. However, there are also lots of numerical
%examples.
%
%\item
%M. Sakarovitch  (1983) "Linear Programming"
%
%\end{enumerate}

 \item[  Miscellaneous:]~~~~
A WWW home page is available. It contains e.g.
miscellaneous information files, assignments and solutions, notes, 
etc...
The URL is:\\
 ftp://orion.uwaterloo.ca/pub/henry/teaching/w96/350.w96/readme.html \\
(On campus a simpler address is:  http://orion/\~{ }hwolkowi)\\
Assignment solutions and copies of other course handouts will be
available on hourly reserve in the Davis Centre Library. The call number 
is XE 1031.\\
A MATLAB Primer is available by anonymous ftp
at orion.uwaterloo.ca as the file  pub/henry/matlab/primer41.ps.Z. You can also get this primer
over WWW with URL\\
  ftp://orion.uwaterloo.ca/pub/henry/matlab/primer41.ps.gz.

The newsgroup uw.co.co350 is for questions and discussions on linear
programming.
\end{description}
\end{document}
