2024 Fall INDENG 162 001 LEC 001

2024 Fall

INDENG 162 001 - LEC 001

Linear Programming and Network Flows

Dorit S Hochbaum

Aug 28, 2024 - Dec 13, 2024
Mo, We
09:00 am - 09:59 am
Class #:28666
Units: 3

Instruction Mode: In-Person Instruction

Current Enrollment

Total Open Seats: -2
Enrolled: 87
Waitlisted: 0
Capacity: 85
Waitlist Max: 0
Open Reserved Seats:
18 reserved for Industrial Engineering & Operations Research Majors with 3 or more Terms in Attendance

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

THU, DECEMBER 19TH
07:00 pm - 10:00 pm
McCone 141
Giannini 141

Other classes by Dorit S Hochbaum

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

Open Reserved Seats:
18 reserved for Industrial Engineering & Operations Research Majors with 3 or more Terms in Attendance

Textbooks & Materials

See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.

Textbook Lookup

Guide to Open, Free, & Affordable Course Materials

eTextbooks

Associated Sections