CIEG 646 - Convex Optimization

Credit(s): 3

CONVEX OPTIMIZATION
Component: Lecture
Optimization principles and techniques including basics of convex analysis, linear/quadratic/non-linear programs, duality and the KKT conditions, network flow, multi-objective decision making, decision analysis, and queuing. Modeling/solving real-world problems using commonly available software tools such as Excel Solver and IBM ILOG CPLEX Optimization Studio.
Repeatable for Credit: N Allowed Units: 3 Multiple Term Enrollment: N Grading Basis: Student Option
Course Typically Offered: Fall