Time Schedule:
Archis Vijay Ghate
IND E 412
Seattle Campus
Modeling and optimization of problems and dynamic programming approach to optimization. Topics include: integer programming formulation techniques, linear and Lagrangian relaxation, branch-and-bound and cutting-plane methods, integer programming applications, and dynamic programming. Prerequisite: IND E 411. Offered: Sp.
Class description
Standard modeling and solution approaches to dynamic, integer, and non-linear programming problems at an undergraduate level in engineering. This class will follow a learn-through-examples technique, meaning that the students will be exposed to important concepts through several small-scale examples.
Student learning goals
General method of instruction
Recommended preparation
Class assignments and grading