IE 511

spring 2021

All Classes

Integer Programming

Credit: 4 hours.

Optimization of linear systems over discrete decision domains. Topics to be covered include Modeling, Polyhedral theory, Integral Polyhedra, Totally Unimodular Matrices, Total Dual Integrality, Computational Complexity, Cutting plane method, Branch and Bound method, and Lagrangian Dual. Structured integer programs involving Matchings, Knapsack, Cuts and Matroids will be studied as applications.

4 graduate hours. No professional credit. Prerequisite: IE 411 or MATH 482.

Status Icon Legend

: Section Status Closed
: Section Status Open
: Section Status Pending
: Section Status Open (Restricted)
: Section Status Unknown

Section Status updates every 10 minutes.

- IE 199
- IE 300
- IE 310
- IE 330
- IE 340
- IE 361
- IE 370
- IE 397
- IE 398
- IE 413
- IE 420
- IE 497
- IE 498
- IE 511
- IE 514
- IE 521
- IE 525
- IE 531
- IE 534
- IE 546
- IE 590
- IE 597
- IE 598
- IE 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor