HEMCHANDRACHARYA NORTH GUJARAT UNIVERSITY, PATAN Programme code : MSCIT Programme Name : MSCIT Course Code MSCIT502CC Semester : 5 Computer Optimization Models(CBO) Course type : Core Course Total Credit : 04 Teaching time (hours) Examination Marking scheme Theory Practical Internal External Total (hrs) (hrs) (Marks) (Marks) 4 X 15 = 60 30 70 ( of 3 hrs) 100 Unit Topic Marks Content Hrs. Credit No. No. W + % 1 Linear Programming Problems (LPP): Formulation of 25% 4 an LPP, Solution of an LPP using Graphic Method and Simplex Method, Slack, Surplus and Artificial Variables, Two-Phase and Big-M Method, Special cases in LPP: Alternate Optimum solution, An Unbounded Solution, Infeasible Solution, Duality in LPP, Integer Simplex Programming. 2 Transportation Problems: Definition, Methods for 25% finding initial basic feasible solutions-North West Corner Rule, Least Cost Cell Entry Method, Vogel’s Approximation Method, Methods for finding Optimal Solution MODI Method, – Assignment Problems: Definition and concept, Solution of an Assignment Problem for optimum solution – Hungarian Method. Sequencing: Job-Sequencing Problems for … Processing N jobs on 2 Machines, Processing N jobs on 3 Machines, Processing N jobs on M Machines, Processing 2 jobs on M Machines (Graphic Method) 3 Inventory Models: What is Inventory?, Types of 25% Inventories, Inventory Decisions, Costs involved in Inventory Problems, Controlled and Uncontrolled Variables, Deterministic Inventory Models (Only Static Demand Models), Selective Approaches to Different Inventory control Systems, Concept of an average Inventories, Concept of Economic Order Quantity (EOQ), (In short Model I, II and Model III) – Replacement Models: Introduction - The Replacement Problem, Replacement of items that deteriorate (With Money Value), Replacement of Items that fail completely (Mortality Theorem) 4 Project Management By PERT and CPM: Introduction, 25% Historical Development of CPM/PERT, Applications of PERT CPM Techniques, Net Work Diagram – – Representation, Rules for Drawing Network, Time estimation and Critical Path in Net-Work Analysis. Queuing theory: Introduction, queuing system, Queuing Problem, Transient and Steady states, traffic Intensity,
HEMCHANDRACHARYA NORTH GUJARAT UNIVERSITY, PATAN Programme code : MSCIT Programme Name : MSCIT Course Code MSCIT502CC Semester : 5 Computer Optimization Models(CBO) Course type : Core Course Total Credit : 04 Teaching time (hours) Examination Marking scheme Theory (hrs) Practical (hrs) Internal (Marks) External Total (Marks) 4 X 15 = 60 30 70 ( of 3 hrs) 100 Unit No. Topic No. Content Hrs. Marks W + % Credit 1 Linear Programming Problems (LPP): Formulation of an LPP, Solution of an LPP using Graphic Method and Simplex Method, Slack, Surplus and Artificial Variables, Two-Phase and Big-M Method, Special cases in LPP: Alternate Optimum solution, An Unbounded Solution, Infeasible Solution, Duality in LPP, Integer Simplex Programming. 25% 4 2 Transportation Problems: Definition, Methods for finding initial basic feasible solutions-North West Corner Rule, Least Cost Cell Entry Method, Vogel’s Approximation Method, Methods for finding Optimal Solution – MODI Method, Assignment Problems: Definition and concept, Solution of an Assignment Problem for optimum solution – Hungarian Method. Sequencing: Job-Sequencing Problems for … Processing N jobs on 2 Machines, Processing N jobs on 3 Machines, Processing N jobs on M Machines, Processing 2 jobs on M Machines (Graphic Method) 25% 3 Inventory Models: What is Inventory?, Types of Inventories, Inventory Decisions, Costs involved in Inventory Problems, Controlled and Uncontrolled Variables, Deterministic Inventory Models (Only Static Demand Models), Selective Approaches to Different Inventory control Systems, Concept of an average Inventories, Concept of Economic Order Quantity (EOQ), (In short Model – I, II and Model III) Replacement Models: Introduction - The Replacement Problem, Replacement of items that deteriorate (With Money Value), Replacement of Items that fail completely (Mortality Theorem) 25% 4 Project Management By PERT and CPM: Introduction, Historical Development of CPM/PERT, Applications of PERT – CPM Techniques, Net – Work Diagram Representation, Rules for Drawing Network, Time estimation and Critical Path in Net-Work Analysis. Queuing theory: Introduction, queuing system, Queuing Problem, Transient and Steady states, traffic Intensity, 25%
Old%20Syllabus_7.docx