Free AKTU notes, question banks, previous year papers & syllabus — new material added regularly. Browse free resources
Cover of AKTU Quantitative Techniques (BMBAI304) Syllabus PDF – MBA (Integrated) 3rd Semester
FREE

AKTU Quantitative Techniques (BMBAI304) Syllabus PDF – MBA (Integrated) 3rd Semester

Quantitative Techniques BMBAI304

All syllabus, notes, question bank & PYQ for this subject

  • English
  • Semester 3
  • 0 downloads
  • 0 views
Official AKTU syllabus of Quantitative Techniques (BMBAI304) for MBA (Integrated) 3rd Semester – 3 credits, L-T-P 3-0-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.

Syllabus — Quantitative Techniques

Download PDF

BMBAI304 · 3 credits · L-T-P 3-0-0

Course Objectives

  1. To define, describe, and explain the fundamentals of Operations Research, including its scope, applications, and various decision-making environments.
  2. To apply, compare, and solve linear programming and replacement problems using structured models and graphical methods.
  3. To construct, compute, and evaluate solutions for transportation and assignment problems, including special cases and optimality tests.
  4. To analyze, differentiate, and simulate strategies in game theory and sequencing problems using appropriate mathematical techniques.
  5. To design, interpret, and perform queuing models and project management techniques like CPM and PERT for effective operational planning.

Unit I: (6 Sessions) - Operations Research & Decision Theory

Origin and Development of Operations Research, Nature and Definition of Operations Research, Objectives of Operations Research, Areas of Applications of Operations Research; Decision-Making Environments: Decision-making under Certainty, Uncertainty and Risk situations, Decision Tree Approach and its Applications.

Unit II: (8 Sessions) -Linear Programming Problem & Replacement Problem

Linear Programming Problem: Introduction, Structure of Linear Programming Model, Advantages of Linear Programming Techniques, Limitations of Linear Programming, Model Formulation, The Graphical Method

Unit III: (9 Sessions) - Transportation Problem & Assignment Problem

Transportation Problem: Introduction, General Mathematical Model of Transportation Problem; Methods of Finding Initial Solution: North-West Corner Method, Least Cost Method, Vogel’s Approximation Method; Test for Optimality: Modified Distribution Method; Variations in Transportation Problem:

Unbalanced Supply and Demand, Degeneracy and its Resolution.

Assignment Problem: Introduction, General Mathematical Model of Assignment Problem, Hungarian Method for solving Assignment Problem; Variations in Assignment Problem: Unbalanced Assignment Problem, Maximization Case in Assignment Problem.

Unit IV: (9 Sessions) – Game Theory & Sequencing Problem

Game Theory: Introduction, Two-person Zero-sum Games; Pure Strategies (Minimax and Maximin Principles): Games with Saddle Point; Mixed Strategies: Game without Saddle Point; The Principles of Dominance; Graphical Method for the Solution of (2 x n) and (m x 2) Games.

Sequencing Problem: Introduction; Sequencing Decision Problem for n-jobs on two machines: Johnson’s Method; Sequencing Decision Problem for n-jobs on three machines: Modified Johnson’s Method;

Graphical Method.

Unit V: (8 Sessions) – Queuing Theory & Project Management

Queuing Theory: Introduction, The Structure of Queuing System, The State of the System; Model I (M/M/I) with its Characteristics.

Project Management: Introduction; CPM Computation; PERT: Estimate the Probability of completing the Project by Scheduled Time; Difference between CPM and PERT.

Suggested Readings

  1. Sharma J K – Quantitative Techniques in Management (3rd Edition, Trinity Press).
  2. Vohra N D - Quantitative Techniques in Management (5th Edition, Tata McGraw Hill Edu.).
  3. Gupta P K & Hira D S – Operations Research (5th Edition, S. Chand)
  4. Gupta R. K. – Operations Reasearch (Krishna Prakashan Media (P) Ltd.)
  5. Kalavathy S – Operations Research (4th Edition, Vikas Publishing House Pvt. Ltd.). Course Outcome: After successful completion of this course, students will be able to:

Course Outcomes

CO No.Course Outcome SummaryBloom’s Taxonomy LevelDomain
CO1Better decision-making through the use of advanced analytical methods, optimization techniques, and data-driven insights, leading to improved efficiency, reduced costs, and enhanced overall performance.K1, K2, K6Remembering, Understanding, Evaluating
CO2Achieving the best possible outcome (maximum profit or minimum cost) within given limitations, resulting in optimal resource allocation and decision-making; reduced maintenance and replacement costs; improved asset utilization and efficiency through timely and informed replacement decisions.K2, K3, K4Understanding, Applying, Analyzing
CO3A cost-efficient transportation plan that meets supply and demand requirements, reducing overall logistics costs and improving operational efficiency; optimal resource allocation, reduced costs, and increased productivity through efficient task assignment and resource utilization.K2, K3, K4, K5Understanding, Applying, Analyzing, Evaluating
CO4Informed strategic decision-making, predicting potential outcomes, and gaining a competitive advantage through understanding of interactions and optimal choices in game-theoretic scenarios; improved efficiency, reduced costs, and enhanced productivity through streamlined processes and optimal task sequencing.K2, K3, K4, K5Understanding, Applying, Analyzing, Evaluating
CO5Reduced waiting times, increased customer satisfaction, and improved service efficiency, leading to enhanced operational performance and cost savings; a well-planned project timeline, accurate time estimation, and identification of critical tasks enabling effective project management and timely completion.K2, K4, K5Understanding, Analyzing, Evaluating

Ratings & Reviews

No reviews yet — share your experience with this item.

Write a review

CAPTCHA — solve the equation shown

Reviews are checked by our team before appearing publicly.