Page 76 - B.E CSE Curriculum and Syllabus R2017 - REC
P. 76

Department of CSE, REC



                                                    SEMESTER VII
            CS17701                               RESOURCE MANAGEMENT TECHNIQUES               L T P C
                                                                                                                                                        3  0 0 3
            OBJECTIVES:
               ●  To be familiar with resource management techniques.
               ●  To learn to solve problems using linear programming.
               ●  To learn to solve problems using Integer programming.
               ●  To learn to solve optimization problems.
               ●  To be exposed to CPM and PERT.

            UNIT I        LINEAR PROGRAMMING                                                                                   9
            Principal components of decision problem – Modelling phases – LP Formulation – Graphic solution – Special
            cases– Simplex method –Artificial variable methods – Big M method – Two phase method.

            UNIT II          DUALITY, TRANSPORTATION AND ASSIGNMENT MODEL                                    9
            Definition of dual problem – Primal – Dual relationships – Duality – Dual simplex methods –Transportation
            Model  –  Initial  Basic  Feasible  Method  –  NWCR  –  LCM  –  VAM  –  Optimal  Solution  –  UV  method  –
            Assignment model- Hungarian Method.

            UNIT III         INTEGER PROGRAMMING                                                                                9
            Formulation of IPP  - Cutting plane algorithm – Gomory’s Pure Integer Method– Gomory’s Mixed Integer
            Method– Branch and bound methods Using Graphical solutions – Multistage (Dynamic) programming – Stage
            Coach Problem– Solving LPP– Salesman Allocation problem.

            UNIT IV         CLASSICAL OPTIMISATION THEORY                                                              9
            Unconstrained external problems, Newton – Raphson method – Equality constraints – Lagrangian method –
            Inequality constraints – Kuhn – Tucker conditions – Simple problems.

            UNIT V          OBJECT SCHEDULING AND SHORTEST ROUTE PROBLEMS                          9
            Network diagram representation –Network Logic – Fulkerson’s Rule –AON– Critical path method – Program
            Evaluation Review Technique –  Shortest route problems.
                                                                                        TOTAL: 45 PERIODS
            OUTCOMES:
            On successful completion of this course, the student will be able to:
               ●  Formulate any given decision making problem and solve simple problems using simplex method and
                   graphical method.
               ●  Apply linear programming to solve real-life applications.
               ●  Apply integer programming to solve real-life applications.
               ●  Apply non-linear programming to solve real-life applications.
               ●  Use PERT and CPM for problems in project management.

             TEXT BOOKS:
               1.  Prem  Kumar  Gupta,  D.S.  Hira,  Operations  Research,  Chand  &  Company  Ltd,  New  Delhi,  Third
                   Edition, 2008.
               2.  Singeresu S Rao, Engineering Optimization - Theory and Practice, John-Wiley & Sons, Third Edition,
                   2009.
             REFERENCES:
               1.  H.A. Taha, Operation Research, Prentice Hall of India, Eighth Edition, 2002.
               2.  Panneerselvam, Operations Research, Prentice Hall of India, Second Edition, 2002
               3.  A.M.  Natarajan,  P.Balasubramani,  A.Tamilarasi,  Operations  Research,  Pearson  Education,  Asia,
                   Second Edition, 2005.
               4.  Vohra, Quantitative Techniques in Management, Tata McGraw Hill, Fourth Edition, 2002.
               5.  Anand Sarma, Operation Research, Himalaya Publishing House, First Edition,2003.

            Curriculum and Syllabus | B.E. Computer Science and Engineering | R2017                    Page 76
   71   72   73   74   75   76   77   78   79   80   81