Spring 2024
INDENG 162 101 - DIS 101
Linear Programming and Network Flows
Baturalp Yalcin
Class #:15956
Units: 3
Instruction Mode:
In-Person Instruction
Time Conflict Enrollment Allowed
Offered through
Industrial Engineering and Operations Research
Current Enrollment
Total Open Seats:
4
Enrolled: 38
Waitlisted: 0
Capacity: 42
Waitlist Max: 15
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.
Other classes by Baturalp Yalcin
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