APMA 1210

Welcome to APMA 1210, an awesome Operations Research adventure awaits you! On this website, you can find the syllabus, lecture notes, homework assignments, and study materials.

Syllabus

Here is the syllabus for the course: APMA 1210 – Syllabus

Lecture Notes

#	Date	Lecture Title
1	Sep 8	Introduction to Operations Research
2	Sep 13	Intro to Mathematical Programming
3	Sep 15	Linear Programming
4	Sep 20	Geometry of Feasible Regions Convexity
5	Sep 22	Extreme Points of Feasible Regions Simplex Algorithm (I)
6	Sep 27	Simplex Algorithm (II)
7	Sep 29	Simplex Algorithm (III)
8	Oct 4	LP Duality (I)
9	Oct 6	LP Duality (II)
10	Oct 11	Sensitivity Analysis
11	Oct 13	Midterm 1
12	Oct 18	Game Theory
13	Oct 20	Network Problems (I)
14	Oct 25	Network Problems (II)
15	Oct 27	Network Simplex Algorithm
16	Nov 1	Max Flow (Min Cut)
17	Nov 3	Dynamic Programming
18	Nov 10	Integer Programming (I)
19	Nov 15	Midterm 2
20	Nov 17	Integer Programming (II)
21	Nov 22	Branch and Bound
22	Nov 29	Non-Linear Programming (I)
23	Dec 1	Non-Linear Programming (II)
24	Dec 6	Gradient Descent
25	Dec 8	Review
	Dec 14	Final Exam

Homework

Homework	.tex file	Due Date
HW 1	tex	Sep 21
HW 2	tex	Sep 28
HW 3	tex	Oct 6
HW 4	tex	Oct 26
HW 5	tex	Nov 2
HW 6	tex	Nov 10
HW 7	tex	Dec 7

Recitation

Recitation	Week of	Solutions
Recitation 1	Sep 19	Solutions
Recitation 2	Sep 26	See main file
Recitation 3	Oct 3	See main file
Recitation 4	Oct 10	Solutions
Recitation 5	Oct 24	Solutions
Recitation 6	Oct 31	See main file
Recitation 7	Nov 7	See main file
Recitation 8	Nov 14	Solutions
Recitation 9	Nov 28	See main file
Recitation 10	Dec 5	See main file