IEM 6033

Linear Optimization

Oklahoma State University · UGRD · Fall 2026

1 section

Catalog description

Description: Mathematical theory of linear optimization and the implications for algorithm development. Fundamentals of convex analysis, polyhedral sets, development of the simplex method, Farkas’ lemma, development of duality theory, sensitivity analysis, Dantzig-Wolfe decomposition, Benders decomposition, interior point algorithms. Previously offered as IEM 5033.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 3 hours ago

001

Availability not recently verified

Class #oklahoma_state-4630Fall 2026UGRD

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?