Course Syllabus
This syllabus outlines the modules of Optimization Techniques.
- Formulation of linear programming problems; introduction and modelling
- Simplex method for unrestricted variables; the two-phase method
- Dual simplex method; parametric linear programming
- Upper bound technique; interior point algorithm; linear goal programming
- Introduction to integer linear programming
- Cutting plane method (Gomory's algorithm)
- Branch and bound method
- Unconstrained optimization; constrained optimization with equality constraints
- Karush-Kuhn-Tucker (KKT) conditions
- Quadratic programming: Wolfe's method and Beale's method
- Introduction to game theory; types of games; strategies and payoffs
- Two-person zero-sum games; dominant strategies
- Maximin / minimax principle and saddle points
- Games without saddle points: mixed strategies
- Introduction to inventory theory; notation and demand models
- Economic Order Quantity (EOQ) Model-I and Model-II with non-uniform demand
- Economic Production Quantity (EPQ); EOQ with planned shortages