We will cover Chapters 1-4 and Chapters 6-7 and selected sections from other Chapters of the text. Toptics include linear programming models, simplex algorithms for solving linear programming problems and tableaux, linear programming duality and sensitivity analysis, Khachian's Ellipsoid algorithm, affine scaling algorithms, Karmarkar's projective algorithm and analysis of selected applications. We will use matrix theory extensively. Students are responsible for all material in the text and all material presented in class. This includes any material not in the text and all material in the text that was not presented in class.
Homework:
Homework accounts for 30% of the total course grade and is assigned in the table at the bottom of this page.
Project:
We will have one course project that accounts 10% in the course evaluation.
Quizzes:
A total of 4 quizzes will be given. They will cover all of the material before the day of the quiz. No make up quiz will be given. However, I will drop your worst quiz.
Final:
The final exam will be 2:45-4:45pm on Tuesday, April 27.
Grading:
The grading of the course consists of the final
30%, the quizzes 30%, homework 30% and project 10%. This gives a total of 100%.
Grading scale is approximately as follows:
A (85-100%) BA(78-84.99%) B (71-77.99%) CB(63-70.99%)
C(55-62.99%) DC(50-54.99%) D(43-49.99%) E(0-42.99%)
Homework problems:
|
|
|||
| Chapter | Date Due | Problems | |
|
2
|
1/27
|
2,3,4,6,8,11 | |
|
|
1/27
|
Quiz 1 | |
|
3
|
2/10
|
1,2,3,6 | |
|
3
|
2/24
|
9,12,17 | |
|
4
|
3/3
|
1,3,5,7,11,12 | |
|
4
|
3/10
|
14,15, 20, 21 | |
|
|
3/10
|
Quiz 2 | |
|
6
|
3/24
|
1,2,4,6 | |
|
6
|
3/31
|
8,10,17,24 | |
|
|
3/31
|
Quiz 3 | |
|
7
|
4/7
|
1,2.7 | |
|
|
4/7
|
Quiz 4 | |
|
11
|
4/14
|
1,2.7 | |
|
11
|
4/21
|
10,11 | |
|
|
4/21
|
Project Reports | |
|
|
4/27
|
Monday, Final 5:00-7:00pm | |