Syllabus
|
Course Code: MCA-20-45 Course Name: Elective-VI - (i) Optimization Techniques |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Introduction: The Historical development, Nature, Meaning and Management Application of Operations research. Modelling, Its Principal and Approximation of O.R. Models, Main characteristic and phases, General Methods of solving models, Scientific Methods, Scope, Role on Decision Making and Development of Operation Research in India. Linear Programming: Formulation, Graphical solution, standard and matrix form of linear programming problems, Simplex method and its flow chart, Two-phase Simplex method, Degeneracy. |
|
| 2 | Duality in LPP: Definition of Dual Problem, General Rules for converting any Primal into its Dual, Dual Simplex method and its flow chart. Integer Programming: Importance, Applications and Classification, Gomory's all integer programming problem technique and its flow chart, Branch and Bound Method. |
|
| 3 | Transportation Models: Formulation of problem, Obtaining Initial Basic feasible solution, Optimality tests, Progressing towards optimal solution, Unbalanced Transportation Problems. Assignment Models: Formulation of problem, Hungarian Method for Assignment Problems, Unbalanced Assignment Problems. |
|
| 4 | Inventory theory Costs involved in inventory problems - single item deterministic models-economic lot size models without shortages and with shortages having production rate infinite and finite. PERT and CPM: Basic steps in PERT/CPM, Techniques, Network Diagram Representation, Forward and Backward Pass-computation, Representation in Tabular form, Determination of Critical path, Critical activity, Floats and Slack Times, Implementation in any programming language. |
|
