Prerequisites/Corequisites: Take ENGR-355. (Required, Previous). | Take MATH-304 PHYS-220. (Required, Previous or concurrent).
Credit Hours: Min: 3; Max:
Description: This course exposes students to linear and integer programming using optimization (e.g., Simplex, Excel Solver, CPLEX) and heuristic techniques (e.g., Greedy, Genetic). A wide array of standard optimization problems such as Knapsack, Traveling Salesman and Cutting Plane will be discussed using applications from a variety of fields (health care, energy, logistics/transportation, social networking, etc.). Extensions to mixed integer programming and non-linear programming will be introduced in the later stages of the course.