Spring 2022
INDENG 162 001 - LEC 001
Linear Programming and Network Flows
Dorit S Hochbaum
Class #:22083
Units: 3
Instruction Mode:
In-Person Instruction
Offered through
Industrial Engineering and Operations Research
Current Enrollment
Total Open Seats:
24
Enrolled: 56
Waitlisted: 0
Capacity: 80
Waitlist Max: 20
No Reserved Seats
Hours & Workload
2 hours of instructor presentation of course materials per week, 1 hours of the exchange of opinions or questions on course material per week, and 6 hours of outside work hours per week.
Final Exam
MON, MAY 9TH
07:00 pm - 10:00 pm
Physics Building 1
Course Catalog Description
This course addresses modeling and algorithms for optimization of linear constrained optimization problems. The simplex method; theorems of duality; complementary slackness. Applications in production planning and resource allocation. Graph and network problems as linear programs with integer solutions. Algorithms for selected network flow problems. Transportation and logistics problems. Dynamic programming and its role in applications to shortest paths, project management and equipment replacement.
Rules & Requirements
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials