{"id":8836,"date":"2019-12-15T04:52:48","date_gmt":"2019-12-15T04:52:48","guid":{"rendered":"https:\/\/www.inspirenignite.com\/vtu\/optimization-techniques-syllabus-for-vtu-be-2017-scheme-open-elective-1\/"},"modified":"2019-12-15T04:52:48","modified_gmt":"2019-12-15T04:52:48","slug":"optimization-techniques-syllabus-for-vtu-be-2017-scheme-open-elective-1","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/vtu\/optimization-techniques-syllabus-for-vtu-be-2017-scheme-open-elective-1\/","title":{"rendered":"Optimization Techniques Syllabus for VTU BE 2017 Scheme (Open Elective-1)"},"content":{"rendered":"

Optimization Techniques detail syllabus for various departments, 2017 scheme is taken from VTU<\/a> official website and presented for VTU students. The course code (17ME561), and for exam duration, Teaching Hr\/week, Practical Hr\/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below.<\/p>\n

For all other open elective-1 syllabus for vtu be 2017 scheme you can visit Open Elective-1 syllabus for VTU BE 2017 Scheme Subjects<\/a>. The detail syllabus for optimization techniques is as follows.<\/p>\n

Course Objectives:<\/h4>\n

The general objectives of the course is to:<\/p>\n

    \n
  1. Introduce the fundamental concepts of Optimization Techniques;<\/li>\n
  2. Make the learners aware of the importance of optimizations in real scenarios;<\/li>\n
  3. Provide the concepts of various classical and modern methods of for constrained and unconstrained problems in both single and multivariable.<\/li>\n<\/ol>\n

    Module 1
    \nFor complete syllabus and results, class timetable and more pls     download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n

    Module 2
    \n<\/h4>\n

    Linear Programming Various definitions, statements of basic theorems and properties, Advantages, Limitations and Application areas of Linear Programming, Graphical method of Linear Programming problem. Simplex Method – Phase I and Phase II of the Simplex Method, The Revised Simplex method, Primal and Dual Simplex Method, Big -M method.
    \nTransportation Problem
    \nFinding initial basic feasible solution by north – west corner rule, least cost method and Vogel’s approximation method – testing for optimality of balanced transportation problems. (Including assignment and travelling salesman problems) (No degeneracy problems)
    \nQueuing
    \nQueuing Models : Essential features of queuing systems, operating characteristics of queuing system, probability distribution in queuing systems, classification of queuing models, solution of queuing M\/M\/1 : \/FCFS,M\/M\/1 : N\/FCFS, M\/M\/C : \/FCFS, M\/M\/C : N\/FCFS.\n<\/p>\n

    Module 4 <\/h4>\n

    Dynamic Programming
    \nDynamic programming multistage decision processes – types – concept of sub optimization and the principle of optimality – computational procedure in dynamic programming – examples illustrating the calculus method of solution – examples illustrating the tabular method of solution.
    \nInteger Programming
    \nPure and mixed integer programming problems, Solution of Integer programming problems – Gomory’s all integer cutting plane method and mixed integer method, branch and bound method, Zero-one programming.\n<\/p>\n

    Module 5 <\/h4>\n

    For complete syllabus and results, class timetable and more pls download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n

    Course Outcomes:<\/h4>\n
      \n
    1. Understand the overview of optimization techniques, concepts of design space, constraint surfaces and objective function.<\/li>\n
    2. Review differential calculus in finding the maxima and minima of functions of several variables.<\/li>\n
    3. Formulate real-life problems with Linear Programming.<\/li>\n
    4. Solve the Linear Programming models using graphical and simplex methods.<\/li>\n
    5. Formulate real-life transportation, assignment and travelling salesman problems to find the optimum solution using transportation algorithms<\/li>\n
    6. Analyze the Queuing model for effective customer satisfaction<\/li>\n
    7. Apply dynamic programming to optimize multi stage decision problems.<\/li>\n
    8. Determine the level of inventory that a business must maintain to ensure smooth operation.<\/li>\n
    9. Construct precedence diagram for series of activities in a huge project to find out probability of expected completion time using PERT-CPM networks. Also reduce the duration of project by method of crashing.<\/li>\n<\/ol>\n

      Text Books:<\/h4>\n
        \n
      1. Engineering optimization: Theory and practice-by S.S.Rao, New Age International (P) Limited.<\/li>\n
      2. Operations Research: An Introduction by H A Taha, 5th Edition, Macmillan, New York.<\/li>\n
      3. Operations Research by NVR Naidu, G Rajendra, T Krishna Rao, I K International Publishing house, New Delhi.<\/li>\n<\/ol>\n

        Reference Books:<\/h4>\n
          \n
        1. Optimization Methods in Operations Research and systems Analysis – by K.V. Mittal and C. Mohan, New Age, International (P) Limited, Publishers<\/li>\n
        2. Operations Research – by S.D.Sharma, KedarnathRamanath& Co<\/li>\n
        3. Linear programming, G. Hadley, Narosa Publishing House, New Delhi.<\/li>\n
        4. Industrial Engineering and Production Management, M. Mahajan, DhanpatRai& co<\/li>\n<\/li>\n<\/ol>\n

          For detail syllabus of all other subjects of BE do syllabus for different schemes from menu given on top.<\/p>\n

          Dont forget to download iStudy<\/a> for latest syllabus and results, class timetable and more.<\/p>\n","protected":false},"excerpt":{"rendered":"

          Optimization Techniques detail syllabus for various departments, 2017 scheme is taken from VTU official website and presented for VTU students. The course code (17ME561), and for exam duration, Teaching Hr\/week, […]<\/p>\n","protected":false},"author":2298,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[15],"tags":[],"class_list":["post-8836","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/posts\/8836","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/users\/2298"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/comments?post=8836"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/posts\/8836\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/media?parent=8836"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/categories?post=8836"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/vtu\/wp-json\/wp\/v2\/tags?post=8836"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}