| Course Outcomes |
Course Descriptions |
Bloom’s taxonomy |
| CO1 |
Be able to understand the characteristics of different types of decision-making
environments and the appropriate decision making approaches and tools to be used
in each type. |
Knowledge ( K2)/ Remembering ( K1) |
| CO2 |
To formulate linear programming problem and to find optimal solution by
graphical simplex method. |
Knowledge ( K2) |
| CO3 |
Be able to build and solve Transportation Models and Assignment Models also to
solve game theory problems by understanding pure and mix strategies. |
Applying ( K 4) |
| CO4 |
To assign optimal sequence of difference jobs on different machines and develop
understanding of queuing theory concepts. |
Applying ( K 4) |
| CO5 |
To implement replacement of equipments at right time and able to implement
project management concepts like CPM, PERT to reduce cost and time. |
Synthesizing ( K6)/ Evaluating ( K7) |
