Course Code |
Course Outcomes |
NP40.1.1 |
Determine Mathematical formulation of given design problem and achieve optimal solution using Graphical method, Cutting plane method. |
NP40.1.2 |
Solve Linear programming problems using Simplex method, Two Phase method, Big-M method |
NP40.1.3 |
Calculate nonlinear programming problems using Lagrange’s method, K-T conditions and numerical methods like Steepest descent method, Conjugate gradient method. |
NP40.1.4 |
Use PERT and CPM to control and monitor projects effectively. |
NP40.1.5 |
Analyze metaheuristics-based optimization and its applications to solve complex optimization problems using genetic algorithms, tabu search and ant colony optimization. |
Mapping of COs with POs:
Course Code |
PO1 |
PO2 |
PO3 |
PSO1 |
PSO2 |
NP40.1.1 |
2 |
2 |
- |
- |
1 |
NP40.1.2 |
2 |
2 |
- |
- |
1 |
NP40.1.3 |
2 |
2 |
- |
- |
1 |
NP40.1.4 |
2 |
2 |
- |
- |
1 |
NP40.1.5 |
2 |
2 |
- |
- |
1 |