\documentstyle [12pt]{article}


\input fullpage.sty





\newtheorem{th}{Theorem}[section]
\newtheorem{definition}[th]{Definition}
\newtheorem{example}[th]{Example}
\newtheorem{lem}[th]{Lemma}
\newtheorem{co}[th]{Corollary}
\newtheorem{remark}[th]{Remark}
\newtheorem{pro}[th]{Proposition}
\newtheorem{no}[th]{Notation}
\newtheorem{con}[th]{Conjecture}
\newenvironment{proof}{\noindent {\em Proof:}}{\hspace*{1cm}
        \hspace*{\fill}$\rule{1.2ex}{1.4ex}$\medskip} 
\newenvironment{re}{\begin{remark}\rm}{\end{remark}} 
\newenvironment{ex}{\begin{example}\rm}{\end{example}} 
\newenvironment{de}{\begin{definition}\rm}{\end{definition}} 
\renewcommand{\theequation}{\thesection.\arabic{equation}}
\newcommand{\h}{\hspace{2mm}}
 


 \date{August, 1996}

\begin{document}

 

				Math 311
 
 			Course Information


Text: Paul R. Thie


An introduction to linear programming and game theory, Second Edition

Content

1. Mathematical models

2. Linear programming model

3. The simplex method

4. Duality


5.Sensitivity analysis (introduction)


6. The transportation problem


7.Two-person, zero-sum games(introduction)


Exams.


Sep. 30 , M (100)


Nov 6, W   (100)


Dec 4, W (100)


Final exam: Dec 17 8:00 -10:00


Homework: border-line for grades
Office hours: M,W 3:00-4:00 or by appointment

tel: 631-5422(office)

Email: leonid.faybusovich@nd.edu

\end{document}
