
The referred problems are from the textbook "Introduction to Operations Research" by Frederick S. Hiller and Gerald J. Lieberman
(9-th edition) ISBN 978-07-337629-5
Week |
Material to be covered |
hw |
sol |
Sections |
Supplementary Problems
|
Sep 7 |
Classes begin Sep 10 |
|
|
1.1-3.8
|
all odd problems from sections 3.3 -- 3.7 |
Sep 14 |
Intoduction to Linear Programming |
hw1
|
s1 |
3.3 --
3.7 |
3.1-10, 3.1-11, 3.1-12, 3.1-13, 3.4-3, 3.4-4, 3.4-5, 3.4-6, 3.4-8, 3.7-1 |
Sep 21 |
Solving Linear Programming Problems: The Simplex Method |
hw2 |
s2 |
4.1
4.2 |
4.1-1, 4.1-2, 4.1-6, 4.3-3,
4.3-4, 4.3-5, 4.3-6, 4.4-5, 4.4-6, 4.5-4
|
Sep 28 |
Chapter 4
Solving Linear Programming Porblems |
hw3 |
s3
|
4.6
4.7
|
4.6-4, 4.6-7, 4.6-11, 4.6-12
4.7-2, 4.7-3
|
Oct 5 |
Quiz |
|
|
|
Review |
Oct 12 |
Chapter 5 Foundations of the Simplex Method |
|
|
|
5.1.9,5.1-10, 5.2-1, 5.2-2, 5.2-3 |
Oct 19 |
Chapter 6
Duality Theory |
|
|
6.2
6.4 |
6.2-1, 6.2-2, 6.2-3, 6.2-5
6.4-1, 6.4-4, 6.4-5, 6.4-6 |
Oct 26 |
Chapter 7
Other Algorithms for Linear Programming |
|
|
|
7.4-1, 7.4-2, 7.4-3, 7.4-4
Review |
Oct 28 |
Midterm exam |
Nov. 3 |
s4 |
|
|
Nov 2 |
Chapter 8
Transportation Problems |
hw5 |
s5 |
8.1
8.2
8.3 |
8.1-2, 8.1-4, 8.1-5, 8.1-6
8.2-1, 8.2-3, 8.2-4, 8.2-5
8.3-2, 8.3-4, 8.3-5 |
Nov 9 |
Chapter 8, Transportation Problems |
|
|
Review |
|
Nov 16 |
Chapter 9
Network Optimization |
hw6 |
s6 |
9.3
9.4
9.5
|
9.3-2, 9.3-5, 9.3-6
9.4-1, 9.4-2
9.5-3, 9.5-4, 9.5-5 |
Nov 23 |
Chapter 10
Dynamic Programming |
hw7 |
s7 |
10.2
10.3 |
10.2-2, 10.2-4
10.3-3, 10.3-4, 10.3-5, 10.3-6 |
Nov 30 |
No class Nov 27-Nov 30 (Thanksgiving) |
|
|
|
|
Dec 7 |
Chapter 12 |
hw8 |
s8 |
12.3
12.4
12.5 |
all problems (1 -- 6)
all problems (1 -- 7)
all problems (1 -- 7) |
Dec 14 |
Chapter 14 |
|
|
|
optional |
Dec 21 |
Last day of class |
|
|
|
Final exam December 21, at 2 pm |
|
 |

Reading
Syllabus
Grading
Exams & Solutions
Homework
Utilities/software
applications
Contact
Computing
Main Website
APMA 0330
APMA 0340
APMA 1210
APMA 2140
|