This is the complete study package for Optimization Techniques — five powerful OR models for real-world decision problems: transportation, assignment, sequencing, game theory and project scheduling (CPM & PERT). Every concept has two worked examples.
Mathematical formulation; IBFS via North-West Corner, Least-Cost Entry & Vogel's Approximation; MODI method for optimality; degeneracy, unbalanced and maximization variants.
UNIT 2Mathematical formulation; Hungarian method for balanced and unbalanced assignment problems; maximisation; restricted assignment.
UNIT 3Assumptions; Johnson's algorithm for n jobs × 2 machines; n × 3 machines; n × m machines; total elapsed time and idle time computation.
UNIT 4Two-person zero-sum games; pure & mixed strategies; maxmin / minimax principles; saddle point; 2×2 games; graphical method for 2×n / m×2; dominance property.
UNIT 5Network components, nodes & arcs, events & activities, construction rules; time calculations; Critical Path Method (CPM) and Programme Evaluation & Review Technique (PERT).
PRACTICALHands-on problems on TP (NWCM, LCEM, VAM, MODI), assignment (Hungarian), sequencing (Johnson), CPM & PERT, game theory by dominance.
REFERENCECourse outline, textbooks, references and exam blueprint.