IEOR 162: Linear Programming and Network Flows

Instructor: Javad Lavaei
Time: Fridays 1-3pm
Location: 50 Birge
TA: Yuhao Ding (yuhao_ding AT berkeley.edu)
Grader: Serena Cheng (xiquncheng AT berkeley.edu)
Instructor's office hours: Tuesdays 11am-12pm
TA's office hours: Mondays 2-3:30pm
Grading Policy (excluding any curving formula):

• 20% homework

• 30% midterm exam (March 24th)

• 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, energy, and machine learning

Textbook

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

Homework