FACULTY OF MANAGEMENT STUDIES
Integrated MBA – Five Years (Sem.-II)
Effective from Academic Year 2019-20
Subject Code: 1MS3010201 Subject Title: Quantitative Methods for Business II
1. Course Overview
Decision making in management is expected to be on the basis of data available at any point of
time. The data needs to be organised, interpreted & understood. This course will help in
understanding various tools & techniques in managerial statistics & its applications in decision
problems.
2. Course Objectives
After the course, participants
Would be able to solve complex business problem with mathematical & operation
research techniques.
Would be able to bring quantitative understanding in various decision making problems.
3. Teaching Scheme (Hours per week)
Evaluation Scheme (Marks)
Lecture
Tutorial Practical Credit University Continuous Total
(Hrs.)
Assessment Assessment
3 1 0 4 60 40 100
4. Syllabus:
Module Contents Total Weight
No. Hours (%)
1 Linear Programming – I: 9 20
Introduction of Operation Research, Meaning and Uses of Linear
Programming, Mathematical Formulation of Liner Programming,
Problem for Two Variables, Important Terms Used in Linear
Programming, Solution of Liner Programming Problems By Graphical
Method
2 Linear Programming-II: 9 20
Introduction of Simplex Method, Slack Variable, Surplus
Variable, Incoming Variable, Pivot Column, Pivot Row,
Outgoing Variable, Solution of Liner Programming Problems By
Simplex Method.
3 Transportation Problems: 9 20
Formulation of Transportation Problem, Its Initial Basic
Feasible Solution by North-West Corner Rule, Matrix Minima (Least
Cost Method, Vogel’s Approximation Method VAM), and Optimum
Solution by Modified Distribution Method, Degeneracy and Its
Resolution.
4 Assignment Problems: 9 20
Meaning, Assignment Problem with Restriction, Unbalanced
Assignment Problem, Maximization Problems and Its Optimum
Solution by Hungarian Method.
5 Time Series Analysis & Set Theory 9 20
Definitions, Applications and Techniques of Time Series
Sets and Subsets, Unions and Intersections, Complements, Indexed
Families of Sets, Cartesian Product of two Sets, relations, Partitions
and Equivalence Relations, Functions, Images and Inverse Images of
Sets, Composition of Functions, Finite & Infinite Sets
5. Suggested Readings
Text & Reference Books
Author/s Publication Title
Dean & Foster Pearson India Business Statistics
SanchetiKappor Business Mathematics
Ken Black John Wiley Business Statistics For Com temporary Decision Making
Hillier & Lieberman TataMcGraw Introduction to Operations Research
Hill Publication
P. K. Gupta S.Chand.Co Operation research and statistical analysis
and Manmohan
S. D. Sharma KedarNath& Co Operation Research
H. A. Taha PHI Publications Introduction to Operations Research
6. Evaluation Scheme
Sr. No. Component Weight
University Examination
1 * For the written examination, the open book examination may be opted 60%
by the paper setter appropriately
Internal Assessment
Midterm Exam 15 Marks
Quizzes 10 Marks
2 Assignments 10Marks 40%
Class Participation and Attendance 5 Marks
Lesson Plan
Faculty Name: Shakti Dodiya
Lecture No Topic Reference Material
1 Introduction of Operation Research, D. C. Sancheti and V. K. Kapoor
Problem for Two Variables
2 Meaning and Uses of Linear D. C. Sancheti and V. K. Kapoor,
Programming Ken Black
3 Mathematical Formulation of Liner D. C. Sancheti and V. K. Kapoor
Programming
4 Important Terms Used in Linear D. C. Sancheti and V. K. Kapoor
Programming
5, 6, 7, 8, 9 Solution of Liner Programming D. C. Sancheti and V. K. Kapoor,
Problems By Graphical Method
10 Introduction of Simplex Method D. C. Sancheti and V. K. Kapoor,
Ken Black
11 Slack Variable, Surplus D. C. Sancheti and V. K. Kapoor
Variable
12 Incoming Variable, Pivot Column, D. C. Sancheti and V. K. Kapoor
Pivot Row,Outgoing Variable,
13, 14, 15, Solution of Liner Programming D. C. Sancheti and V. K. Kapoor,
16, 17, 18 Problems By Simplex Method. Ken Black
20 Formulation of Transportation D. C. Sancheti and V. K. Kapoor
Problem
21, 22, 23 Its Initial Basic D. C. Sancheti and V. K. Kapoor
Feasible Solution by North-West Corner
Rule,
24, 25 Matrix Minima (Least Cost Method, D. C. Sancheti and V. K. Kapoor
Vogel’s Approximation Method VAM),
26, 27, 28 Optimum Solution by Modified D. C. Sancheti and V. K. Kapoor
Distribution Method,and Degeneracy
and Its Resolution.
29 Assignment Problems: Meaning D. C. Sancheti and V. K. Kapoor,
Ken Black
30, 31 Assignment Problem with Restriction, D. C. Sancheti and V. K. Kapoor,
Ken Black
32 Unbalanced Assignment Problem, D. C. Sancheti and V. K. Kapoor,
Ken Black
33, 34, 35, Maximization Problems and Its D. C. Sancheti and V. K. Kapoor,
36 Optimum Solution by Hungarian Ken Black
Method.
37 Time Series Analysis Applications and D. C. Sancheti and V. K. Kapoor
Techniques of Time Series
38 Set TheoryDefinitions D. C. Sancheti and V. K. Kapoor
Sets and Subsets, Unions and
Intersections, Complements, Indexed
Families of Sets,
39 Cartesian Product of two Sets, D. C. Sancheti and V. K. Kapoor
relations,
40 Partitions and Equivalence Relations, D. C. Sancheti and V. K. Kapoor
Functions,
41 Images and Inverse Images of Sets, D. C. Sancheti and V. K. Kapoor
42 Composition of Functions, Finite & D. C. Sancheti and V. K. Kapoor
Infinite Sets
