|
CO
|
COGNITIVE ABILITIES
|
COURSE OUTCOMES
|
|---|---|---|
|
CO1
|
REMEMBERING
|
Students will be able to recall and define basic concepts such as convex sets, convex combinations, extreme
|
|
CO2
|
UNDERSTANDING
|
Students will be able to explain the formulation techniques of linear programming problems and interpret different types of LPP through examples.
|
|
CO3
|
APPLYING
|
Students will be able to apply the Simplex Method, Big-M
(Penalty) Method, and Dual Simplex Method to obtain optimal
solutions of linear programming problems.
|
|
CO4
|
ANALYSING
|
Students will be able to analyze primal and dual relationships,
interpret solutions of dual problems, and examine project
networks using PERT and CPM to identify critical paths and
floats.
|
|
CO5
|
EVALUATING
|
Students will be able to evaluate strategies in two-person zero-
sum games using maximin and minimax principles, dominance
rules, and compare different solution methods.
|
|
CO6
|
CREATING
|
Students will be able to construct and solve complex game
theory models (2×n and 3×3 games) and develop approximate
solutions using iterative and advanced methods.
|
