MCA-20-45 (i): Optimization Techniques
Type: Elective
Contact Hours: 4 hours/week
Examination Duration: 3 Hours
Mode: Lecture
External Maximum Marks: 75
External Pass Marks: 30 (i.e. 40%)
Internal Maximum Marks: 25
Total Maximum Marks: 100
Total Pass Marks: 40 (i.e. 40%)
Instructions to paper setter for End semester exam:
Total number of questions shall be nine. Question number one will be compulsory and will be consisting of short/objective type questions from complete syllabus. In addition to compulsory first question there shall be four units in the question paper each consisting of two questions. Student will attempt one question from each unit in addition to compulsory question. All questions will carry equal marks.
Course Objectives: The objective of this course is to provide the in-depth coverage of various linear programming problems and their solution techniques. It focuses on various optimization techniques and their applications in problem solving.
Course Outcomes (COs) At the end of this course, the student will be able to:
MCA-20-45 (i).1 understand the role and principles of optimization techniques in business world;
MCA-20-45 (i).2 understand the techniques to solve and use LPP and IPP;
MCA-20-45 (i).3 analyse the optimization techniques in strategic planning for optimal gain;
MCA-20-45 (i).4 understand the techniques to solve networking and inventory issues;
Unit – I
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.
Unit – II
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.
Unit – III
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.
Unit – IV
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.
Text Books:
⦁ Sharma, S.D., Operations Research, KedarNath and Ram Nath, Meerut.
⦁ Gupta P.K., Hira and D.S., Operation Research, Sultan Chand & Sons, New Delhi.
Reference Books:
⦁ KantiSwarup, Gupta P.K. & Man Mohan, Operation Research, Sultan Chand & sons, New Delhi.
⦁ Rao S.S., Optimization Theory and Applications, Wiley Eastern Ltd. New Delhi.
⦁ Taha, H.A., Operation Research – An Introduction, McMillan Publishing Co, New York.
⦁ Gillet, B.E., Introduction to Operations Research: A Computer Oriented Algorithmic Approach, Tata McGraw Hill, New York.
