|
CO
|
COGNITIVE ABILITIES
|
COURSE OUTCOMES
|
|---|---|---|
|
CO1
|
REMEMBERING
|
Recall and define the fundamental concepts of Linear
Programming Problems (LPP); identify and formulate
problems and express them in standard and canonical
forms.
|
|
CO2
|
UNDERSTANDING
|
Explain and interpret the graphical method, simplex
method, Big-M method, and the principle of duality with
suitable examples.
|
|
CO3
|
APPLYING
|
Apply the dual simplex method, and solve transportation
problems using NWCM, LCM, and VAM methods; determine
optimal solutions for balanced transportation and
assignment problems.
|
|
CO4
|
ANALYSING
|
Analyze and compare variations in transportation and
assignment problems; decompose complex linear
programming models into subproblems; interpret
computational outcomes.
|
|
CO5
|
EVALUATING
|
Evaluate and test the convergence of sequences and infinite
series; distinguish between countable and uncountable sets;
verify properties involving absolute value and triangle
inequality.
|
|
CO6
|
CREATING
|
Construct and derive Fourier series representations;
develop analytic functions and their harmonic conjugates;
find transformations under f(z)=1 / z and apply De Moivre’s
theorem to complex problems.
|
