Optimization Theory and Methods

An advanced course on formulating and solving optimization problems, covering the mathematical structures behind linear, integer, and nonlinear programming. Students practice methods such as the simplex algorithm, interior-point techniques, and gradient-based approaches, and apply them to case studies in planning, routing, and scheduling.