Prof. Gordon Woodward
OldH 810A
gwoodwar@math.unl.edu
Math 428/828 Spring 2000
Office Hours
MW 10:30 – 11:30
T 4:00 – 5:30
Ph: 472-7239
Week
Sections
Topics
Partial Assignment List
1
3.1-3.6
Introduction to Linear Programming
3.1(2,4) 3.2(2) 3.4(4,7,9,14)
2
4.1-4.6
Simplex Method: Tabular form
4.1(2,4) 4.2(3,4) 4.3(2,5,9) 4.5(1,2)
4.6(6,7,10,11,16)
3
5.1-5.2
Simplex Method: Matrix Theory I
5.1(1,4,11) 5.2(1,5)
4
5.3
Matrix Theory II; Group Presentations
5.3(3,5,7,12)
5
6.1-6.3
Dual Problem and Role of Duality
6.1(3,4,7,11,15) 6.3(8,9,10)
6
6.4-6.7
Sensitivity Analysis
6.4(6) 6.5(1) 6.6(2,3) 6.7(3,10,19)
7
Review and Group Presentations
8
Exam I (at night)
8
15.1-15.4
Queueing Theory: Main idea
15.3(1) 15.4(1,3,4,6,7,8,9)
9
15.5-15.6
Queueing Theory: Birth – Death
15.5(3,4,6,8,10,11,13,14,15,16)
10
15.6-15.8
Queueing Theory: Birth – Death
15.6(10,12,18) 15.7(3,5,6,9,10)
11
16.1-16.3
Queueing Theory: Cost
TBA
12
16.4
Queueing Theory: Decisions
TBA
13
10.1-10.3
Dynamic Programming: Deterministic
10.2(1,2,4) 10.3(3)
14
Review and Exam II (at night)
15
Group Presentations
16
Final Exam
Friday, May 5, 1:00 – 3:00.
Homework: Problems to hand in will be assigned on Tuesday and collected every Thursday. There will
be two group projects and one group presentation of a problem. Some of the projects may require the
use of the mathlab in Bessey 105.
Hr. Exams
Projects
Presentation
HW
Final Exam
200. pts.
100. (50 each)
30.
75 – 100 (10/assignment)
200.
Total
605 – 630