Search Results

I E 534: Linear Programming

(3-0) Cr. 3.

Prereq: I E 312
Formulation of optimization problems as mathematical models, including linear programming, integer programming concepts, multi-objective optimization, and bilevel optimization. Introduction to classic optimization algorithms, including Simplex, cutting plane, and branch-and-bound. Basic concepts of duality theory and sensitivity analysis. Using computer solvers (Matlab and Gusek) to obtain optimal solutions to optimization models.