Ma 416 - 001   Operations Research -- Spring 1997
Time and Place:    1-1:50 pm   MWF.  CB 337.
Teacher:    Carl Eberhart, 756 POT, 257-1258, carl@ms.uky.edu
Office Hours:   11-12, 2-3  MWF, or by appointment.  Or use email.
Textbook:   Introduction to Operations Research, by F. Hillier and   
G. Lieberman. 6nd Ed., Holden-Day, 1986.        
Brief Syllabus:   Linear programming was born during the second world war, when 
the problem of minimizing the time of transport  of war materials from various ports  to various battles was first formulated  by George Danzig.   The simplex algorithm, which was developed to solve this problem, has since been used to solve a vast number of other problems. One goal for the semester is to learn how to recognize, set up, and solve  linear programming problems for solution using the simplex algorithm.  
We will also learn to use  sensitivity analysis, duality theory,  the fast transportation simplex algorithm, and parametric programming  when appropriate.  Discussion  and problems  relating to these topics is found in chapters 3-8  of Hillier and Lieberman.  
As time permits, we will also work through material on network analysis (chapter 9) and integer programming (Chapter 12). For all but the simplest problems, we will use Maple to carry out the actual  computations.  There is also a disk that comes with the text
that has useful routinues and tutorials on it.  It runs on any dos machine I think.
Homework:   To be successful in this course, you will find it necessary to read and
 work problems outside of class on a regular basis.   Homework assignments will
be discussed in class and taken up periodically for marking.   (10 % of grade)       
Projects:   There will be two Maple projects during the semester.  These will
be  prepared on Maple worksheets which you will email to me.   (25% of grade)   
Exams:    We will have two midterms (20 % each) and a final (25 %).      
Grades:   Your homework, project, and exam grades will be converted to a 
percentage P and an overall grade assigned as follows: 93<=P  A,  90<=P*`<`*93 A-,
 87<=P*`<`*90 B+, 83<=P*`<`*87  B, 80<=P*`<`*83  B-, 77<=P*`<`*80 C+, 73<=P*`<`*77  C ,
 70<=P*`<`*73  C-, 67<=P*`<`*70 D+, 63<=P*`<`*67   D, 60<=P*`<`*63  D- , P<60, E. 
Calendar of class days:      

    [Jan , 15W, 17, 22, 24, 27, 29, 31 , Exam 1 Feb 17]

    [Feb , 3M, 5, 7, 10, 12, 14, 17, 19, 21, 24, 26, 28 ,

    Proj 1 Mar 7]

    [Mar , 3M, 5, 7, 10, 12, 14, 24, 26, 28, 31 , Exam 2 Apr 11]

    [Apr , 2W, 4, 7, 9, 11, 14, 16, 18, 21, 23, 25, 28, 30 ,

    Proj  2  Apr 25]

    [May , 2F   , Final May 6]

Table of Contents