RTMNU Final CSE syllabus

RTMNU · Final Year B.Tech Computer Science & Engineering · CBCS

Optimization Techniques

BTECHCSE702T · Elective IV · Semester VII · 3 credits · College 30 + university 70

One of the Elective IV options.

  1. Unit 1: Linear Programming

    8 hours

    Introduction to operations research; formulating linear programmes; the graphical method for two variables; the simplex method; duality theory and its applications; integer linear programming and the dual simplex method.

    Examined in the 70-mark end-semester paper

    • Operations research and its methodology
    • Formulating linear programs
    • Graphical method
    • Simplex method
    • Duality
    • Integer linear programming
  2. Unit 2: Dynamic Programming and Sequencing

    7 hours

    Dynamic programming — basic concepts, Bellman's principle of optimality, its use in decision problems and the optimal subdivision problem; sequencing — Johnson's algorithm for n jobs through two machines, n jobs through three or more machines, and two jobs through n machines.

    Examined in the 70-mark end-semester paper

    • Dynamic programming
    • Bellman's principle and the optimal subdivision problem
    • Sequencing jobs through two and three machines
  3. Unit 3: Project Management: PERT and CPM

    7 hours

    The origin and use of PERT and CPM, project networks and their diagrams, the critical path, floats, time charts and resource levelling, project cost curves and crashing.

    Examined in the 70-mark end-semester paper

    • CPM and PERT
    • Network floats and resource levelling
    • Project crashing
  4. Unit 4: Queuing Models

    7 hours

    The features and operating characteristics of queuing systems, probability distributions in queuing, the classification of queuing models and the M/M/1 model.

    Examined in the 70-mark end-semester paper

    • Queuing theory and Kendall's notation
    • Arrival and service distributions in queuing
    • M/M/1 queues
  5. Unit 5: Inventory Models

    7 hours

    The inventory problem; deterministic models — the classical EOQ model with and without shortages; models with probabilistic demand; multi-item deterministic models.

    Examined in the 70-mark end-semester paper

    • Deterministic and stochastic inventory models
    • Inventory costs and EOQ
    • Multi-item inventory models

Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).