CO1

Formulation of linear programming

Graphical method, simplex method
Duality theorem
Farka's Lemma
Network models
Transportation problem
Simplex using Big-M Method
Transportation problem using vogel’s method

CO2:
Introduction to integer programming
Branch and bound algorithms
valid inequalities and cuts
Karmarkar’s Algorithms
Fractional Programming-Concave fractional programs
Transformation to a concave program
Introduction to zero-one proble
Necessary requirements Rules for Additive Algorithm and problem solving
Lagrange multipliers
KKT Optimality conditions

CO3:
Combinatorial Optimization-Approximation Algorithms
Submodular functions
Matroids and multilinear extensions
Continuous approximation algorithms
convex and concave closures
Rounding techniques
Heuristics
Meta heuristics Single solution vs population-based meta heuristics
Parallel meta heuristics
simulated annealing

CO4
Introduction to Machine learning
Applications of linear programming in Machine Learning
Constraint programming-Penalty function approach
Barrier function approach
Robust stability of Linear Systems
Robust Linear Programming
Robust Linear Programming (Contd..)
Introduction to Dynamic Programming
The General DP Framework, Bellman Equation

Python codes
->bin packing -co3
->graphical ->co1
->branch and bound ->co2