Not too easy. Not too difficult.
Course Overview:
It's a more general approach to optimise the result under the given constraints. This will be surely helpful in future where we need to minimise the power consumption of a device designed under the given specifications
Course highlights:
LPP formulation, Simplex Algorithm, Dual Simplex, Genetic Algorithm, Hungarian Model, Weak Dual-Primal theorem, Dual LPP, Revised Simplex, General Simplex, Maximising a function with more than one variable under constrained and unconstrained conditions, KKT conditions Dichotomous method, Steep ascent and Steep descent methods etc.
Hours per week:
3-5 hours
Advice for students:
Simple practice and proper understanding of various algorithms, their advantages and limitations