IEOR 162: Linear Programming and Network Flows

Professor Javad Lavaei, UC Berkeley

Instructor: Javad Lavaei
Time: Tuesdays and Thursdays, 1-2pm
Location: 150 GSPP
TAs: Donghao Ying (donghaoy AT berkeley.edu) and Jooseung Lee (jooseung_lee@berkeley.edu AT berkeley.edu)
Grader: Christina Giannella-Nicolaides (christina.nic117 AT berkeley.edu)
Instructor's office hours: Thursdays 10-11am
TAs’ office hours: Tuesdays 10-11am and Fridays 2:30-3:30pm
Grading Policy (excluding any curving formula):

20% homework
30% midterm exam (October 18th)
50% final exam

Description

Syllabus:

Linear programming
Simplex method
Duality
Cutting planes for integer variables
Graph and network flow problems
Dynamic programming
Applications in production planning, resource allocation, transportation, logistics, and machine learning

Textbook

“Introduction to Mathematical Programming: Volume One“ by Wayne L. Winston and Munirpallam Venkataramanan, Fourth edition

Homework

Homework 7 (course project) (due on December 2 at 5pm)

Homework 8