Linear and Mixed Integer Optimization. (3-0) 3 Credit Hours

Catalog description

Prerequisite: ME 2173 or equivalent. Graduate standing in engineering or consent of instructor. Introduction to the theory of linear programming and duality, algorithms for solving linear programs, network simplex, integer and mixed integer programming (e.g., simplex, branch and bound and branch and cut). This course provides an overview of optimization theory and algorithms as well as emphasizes its applications in different areas of Engineering. (Same as EGR 6033. Credit cannot be earned for both ME 6033 and EGR 6033.) This course has Differential Tuition.