This course introduces applications and algorithms for linear, network, integer, and nonlinear optimization. Topics include the primal and dual simplex methods, network flow algorithms, branch and bound, interior point methods, Newton and quasi-Newton methods, and heuristic methods. Students will gain experience in formulating models and implementing algorithms using MATLAB. No previous experience with the software is required. Prerequisite(s): Multivariate calculus, linear algebra. Comfort with reading and writing mathematical proofs would be helpful but is not required. Course Note(s): Due to overlap in subject matter in EN.625.615 and EN.625.616, students may not receive credit towards the MS or post-master’s certificate for both EN.625.615 and EN.625.616.