Skip to content

Master Lesson Plan

How to Use This Plan

The course allocates 45 lecture hours across four units (10 + 10 + 15 + 10). This master plan converts those hours into 45 self-contained one-hour lessons. Each lesson has its own detailed note PDF in the corresponding Unit-n folder, containing:

  • Learning outcomes for that hour
  • Formal definitions
  • Full mathematical development with derivations
  • 4–5 fully solved problems
  • Practice problems with answers
  • A one-page summary and a link to the interactive web platform for that unit

Pacing advice. Optimization Methods is a procedural subject: students learn by executing algorithms by hand. Reserve the last 15 minutes of every lecture for one solved problem worked live on the board, and let students verify it afterwards on the unit's interactive platform.

Unit-Wise Distribution

Unit Theme Hours Lessons Weightage (indicative)
I Linear Programming, Transportation, Assignment 10 L01–L10 22 %
II Game Theory, Sequencing, Integer Programming, Networks 10 L11–L20 22 %
III Queuing Theory and Inventory Control 15 L21–L35 34 %
IV Search Methods and Non-Linear Programming 10 L36–L45 22 %
Total 45 45 100 %

Unit I — Linear Programming, Transportation and Assignment (10 hours)

Hr Lesson Topic Key Ideas Delivered
1 L01 Operations Research and the Modelling Approach History, phases of an OR study, model taxonomy, decision variables, objective, constraints
2 L02 Introduction to Linear Programming and Formulation Standard/canonical forms, assumptions of LP, formulating product-mix, diet and blending problems
3 L03 Graphical Method Feasible region, corner-point theorem, iso-profit lines, unbounded / infeasible / multiple optima
4 L04 Simplex Method I — Theory Slack variables, basic solutions, BFS ↔ corner points, optimality and entering/leaving rules
5 L05 Simplex Method II — The Tableau Algorithm Full tableau iterations, pivoting, minimum-ratio test, reading the optimal solution
6 L06 Big-M and Two-Phase Methods; Special Cases Artificial variables, degeneracy, unboundedness, alternate optima, infeasibility
7 L07 Duality and Sensitivity (support topic) Primal–dual pairs, weak/strong duality, shadow prices, complementary slackness
8 L08 Transportation Problem — Formulation and Initial BFS Balanced/unbalanced models, NWCM, LCM, VAM
9 L09 Transportation Problem — Optimality by MODI / Stepping Stone \(u_i+v_j\) multipliers, opportunity costs, looping, degeneracy resolution
10 L10 Assignment Problem and the Travelling Salesman Problem Hungarian method, unbalanced and maximisation cases, TSP via assignment with sub-tour elimination

Unit I checkpoint: 20-mark class test after Hour 10.

Unit II — Game Theory, Sequencing, Integer Programming and Networks (10 hours)

Hr Lesson Topic Key Ideas Delivered
11 L11 Game Theory — Two-Person Zero-Sum Games, Pure Strategies Payoff matrix, maximin/minimax, saddle point, value of the game
12 L12 Mixed Strategies and Dominance Odds method for \(2\times2\), dominance rules, expected payoff
13 L13 Graphical and LP Solution of Games \(2\times n\) and \(m\times 2\) graphical method, LP formulation of an arbitrary game
14 L14 Sequencing — n Jobs through 2 Machines Johnson's rule, total elapsed time, idle time computation
15 L15 Sequencing — n Jobs through 3 Machines and 2 Jobs through m Machines Reduction to two machines, graphical method with 45° movement
16 L16 Integer Programming — Formulation and Gomory's Cutting Plane Why rounding fails, fractional cut derivation, pure IP algorithm
17 L17 Gomory's Method for Mixed Integer Programs Mixed cut construction, worked MILP
18 L18 Branch and Bound Method Branching, bounding, fathoming, 0–1 knapsack and general IP
19 L19 Network Scheduling — Basic Terms and CPM AON/AOA, forward/backward pass, floats, critical path, crashing
20 L20 PERT Three time estimates, Beta distribution, project variance, probability of completion

Unit II checkpoint: 20-mark class test after Hour 20.

Unit III — Queuing Theory and Inventory Control (15 hours)

Hr Lesson Topic Key Ideas Delivered
21 L21 Characteristics of Queuing Systems Input process, service mechanism, queue discipline, Kendall–Lee notation, terminology
22 L22 The Poisson Process and the Exponential Distribution Axioms, derivation of the Poisson pmf, memorylessness, inter-arrival times
23 L23 Birth–Death Processes and Steady-State Balance Equations Rate diagrams, general birth–death solution, ergodicity
24 L24 Model I — (M/M/1):(∞/FCFS) Derivation \(P_n=(1-\rho)\rho^n\), \(L_s, L_q, W_s, W_q\), Little's law
25 L25 Model I — Applications and Problems Costing, design decisions, extensive numerical practice
26 L26 Model II — (M/M/1):(N/FCFS) Finite Capacity Truncated queue, effective arrival rate, blocking probability
27 L27 Model III/IV — (M/M/C):(∞/FCFS) Multi-Server Queue Erlang-C, derivation of \(P_0\), \(L_q\), server utilisation
28 L28 Model IV/V — (M/M/C):(N/FCFS) and Finite-Source Queues Finite waiting room with \(c\) servers, machine-repair model
29 L29 Applications and Economic Analysis of Queues Cost of waiting vs cost of service, optimal number of servers, simulation cross-check
30 L30 Inventory Control — Concepts and Cost Structure Functions of inventory, holding/ordering/shortage costs, deterministic vs probabilistic, ABC
31 L31 EOQ Model with No Shortage Derivation of \(Q^*=\sqrt{2C_oD/C_h}\), total cost, cycle time, sensitivity
32 L32 EOQ Model with Shortages Permitted Backorder model, optimal \(Q^*\) and \(S^*\), cost split
33 L33 Production (Finite Replenishment) Model without Shortage EPQ derivation, \(Q^*=\sqrt{2C_oD/(C_h(1-D/P))}\)
34 L34 Production Model with Shortage Four-parameter model, maximum inventory and shortage levels
35 L35 Quantity Discounts and Consolidation All-units discount algorithm, multi-item constraints, unified revision

Unit III checkpoint: 30-mark test after Hour 35.

Unit IV — Search Methods and Non-Linear Programming (10 hours)

Hr Lesson Topic Key Ideas Delivered
36 L36 Introduction to Non-Linear Programming Classification of optimisation problems, convex sets and functions, unimodality
37 L37 Conditions for Unconstrained Optimality Stationary points, Hessian test, single- and multi-variable optimality conditions
38 L38 One-Dimensional Minimisation — Bracketing and Elimination Unrestricted search, exhaustive search, dichotomous and interval-halving methods
39 L39 Fibonacci Search Method Fibonacci sequence, reduction ratio, algorithm and full numerical trace
40 L40 Golden Section Search Golden ratio derivation, algorithm, comparison with Fibonacci
41 L41 Interpolation and Gradient-Based 1-D Methods Quadratic interpolation, Newton–Raphson, secant, quasi-Newton
42 L42 Unconstrained Multivariable Optimisation Steepest descent, Newton's method, conjugate gradient (Fletcher–Reeves)
43 L43 Constrained Optimisation — Graphical Solution and Lagrange Multipliers Equality constraints, bordered Hessian, sensitivity meaning of \(\lambda\)
44 L44 Kuhn–Tucker (KKT) Conditions Inequality constraints, complementary slackness, constraint qualification, sufficiency under convexity
45 L45 Quadratic Programming QP standard form, KKT system, Wolfe's method, Beale's method

Mapping of Lessons to Course Learning Outcomes

CLO Description Lessons
CLO 1 Understand operations research concepts L01, L21, L30, L36
CLO 2 Analyse the need of optimisation techniques L03–L07, L16–L20, L38–L42
CLO 3 Design and develop mathematical models for real applications L02, L08–L15, L24–L35, L43–L45
CLO 4 Modelling skills to describe and formulate optimization problems All lessons; assessed in the practical file

Mapping of Lectures to Practicals

Practical (from the course outline) Hours Supporting Lessons
1. LP formulation and graphical solution 2 L02, L03
2. Simplex method 2 L04, L05, L06
3. Transportation — balanced/unbalanced 2 L08, L09
4. Assignment and TSP 2 L10
5. Game theory 2 L11, L12, L13
6. Sequencing 2 L14, L15
7. Branch and bound 2 L18
8. CPM and PERT 2 L19, L20
9. M/M/1 simulation 2 L22, L24, L25
10. M/M/C analysis 2 L26, L27, L28
11. EOQ with/without shortages 2 L31, L32
12. Replacement problems 2 L30 (appendix), L35
13. Information theory measures 2 L01 (appendix)
14. Fibonacci and golden section 2 L39, L40
15. Unconstrained NLP and graphical solutions 2 L37, L42, L43

Suggested Evaluation Scheme

Component Marks Timing
Internal Assessment — Test 1 (Units I–II) 15 After Hour 20
Internal Assessment — Test 2 (Units III–IV) 15 After Hour 45
Practical file and continuous evaluation 25 Continuous
Practical viva / end-semester practical exam 25 End of semester
End-semester theory examination 70 End of semester

Interactive Support

Each unit has a browser-based interactive platform in the folder Optimization Methods/Interactive-Web-Platform/. Open index.html in any modern browser — no installation, no internet connection required.

Unit Platform What Students Practise
I unit1-lp-lab.html Graphical LP solver, simplex tableau stepper, transportation and Hungarian solvers
II unit2-games-networks-lab.html Game solver, Johnson's rule Gantt chart, branch-and-bound tree, CPM/PERT network
III unit3-queue-inventory-lab.html Live M/M/1 and M/M/c calculators, discrete-event queue simulator, EOQ sawtooth explorer
IV unit4-nlp-search-lab.html Function plotter with Fibonacci/golden-section traces, gradient descent on contours, KKT checker