MA372
Optimization
0.5 Credit

Hours per week:
  • Lecture/Discussion: 3

Linear programming algorithms, duality theory and post-optimum sensitivity analysis. Integer programming. Deterministic and stochastic dynamic programming. Kuhn-Tucker conditions for optimality. Quadratic programming. Non-linear programming. Network optimization. Modeling and applications.

Additional Course Information
Prerequisites
MA201, MA222.