Course Policy Operations Research

Mukesh Patel School of Technology Management & Engineering

School of Technology Management and Engineering

Course Policy Document

Course Name - (Code): Operations Research – (702CO0E003)

Program and Semester: B Tech/MBA Tech Computer

Pre-requisite Course : None
Engineering/BTI CE, Semester-V/IX
L T P C H
2 0 2 3 4
Academic Year: 2024-25 Credit Details:

Name of Course Faculty: Dr. Praveen Kumar

Loharkar
Program: B.Tech CE V Sem.
Contact Details: [email protected]

Office Hours: 10:00 AM TO 05:00 PM

Pre-Course Activity:
Explore:
 Application of Operations Research
 Role of Software Engineer in this domain

Course link: Operations Research B.Tech CE B 2024-25 | General | Microsoft Teams

1. Introduction to the Course

1.1 Importance of the Course
1.1.1 Domain Relevance:
Operations research (OR) is a field of study that uses advanced analytical
methods to make better decisions. It applies mathematical modeling,
statistical analysis, optimization techniques, and computational algorithms
to solve complex problems in various domains. Operations research is
relevant across a wide range of domains where complex decisions need to
be made efficiently and effectively. Its application areas continue to expand
as businesses and organizations seek to optimize their processes, resources,
and strategies in an increasingly competitive and data-driven environment.
1.1.2 Industry Relevance:
Course Policy Operations Research

Operations research (OR) plays a crucial role in various industries by

applying mathematical and analytical methods to solve complex decision-
making problems. OR techniques such as optimization models, network
analysis, and simulation are used to optimize inventory management,
transportation logistics, warehouse location, and supply chain efficiency.
This helps in reducing costs, improving delivery times, and enhancing
overall supply chain resilience. OR techniques are applied in network
design, capacity planning, and resource allocation in telecommunications
networks. Optimization models help in improving network performance,
minimizing costs, and enhancing service reliability.
1.2 Objectives of the Course:
1.2.1 To provide knowledge of the basic techniques and tools of Operations
Research.
1.2.2 To apply these techniques constructively to make effective business
decisions.
2. Course Outcomes (CO), Mapping with Program Outcomes (PO), and
Program Specific Outcomes (PSO)
2.1 Course Outcomes
2.1.1 CO1: Solve problems using concepts of Linear Programming and integer
programming.
2.1.2 CO2: Solve problems based on Transportation Models and Assignment
Models.
2.1.3 CO3: Apply operations research techniques in industrial optimization
problems.
2.1.4 CO4: Model and analyze conflicting situations using game theory.
2.2 Program Outcomes(PO):
2.2.1 PO-1: Engineering knowledge: Apply the knowledge of mathematics,
science, engineering fundamentals, and an engineering specialization to the
solution of complex engineering problems.
2.2.2 PO-2: Problem analysis: Identify, formulate, review research literature, and
analyze complex engineering problems reaching substantiated conclusions
using first principles of mathematics, natural sciences, and engineering
sciences.
Course Policy Operations Research

2.2.3 PO-3: Design/development of solutions: Design solutions for complex

engineering problems and design system components or processes that meet
the specified needs with appropriate consideration for the public health and
safety, and the cultural, societal, and environmental considerations.
2.2.4 PO-4: Conduct investigations of complex problems: Use research-based
knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid
conclusions.
2.2.5 PO-5: Modern tool usage: Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the
limitations.
2.2.6 PO-6: The engineer and society: Apply reasoning informed by the
contextual knowledge to assess societal, health, safety, legal and cultural
issues and the consequent responsibilities relevant to the professional
engineering practice.
2.2.7 PO-7: Environment and sustainability: Understand the impact of the
professional engineering solutions in societal and environmental contexts,
and demonstrate the knowledge of, and need for sustainable development.
2.2.8 PO-8: Ethics: Apply ethical principles and commit to professional ethics
and responsibilities and norms of the engineering practice.
2.2.9 PO-9: Individual and team work: Function effectively as an individual, and
as a member or leader in diverse teams, and in multidisciplinary settings.
2.2.10 PO-10: Communication: Communicate effectively on complex engineering
activities with the engineering community and with society at large, such
as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear
instructions.
2.2.11 PO-11: Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply
these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
Course Policy Operations Research

2.2.12 PO-12: Life-long learning: Recognize the need for, and have the
preparation and ability to engage in independent and lifelong learning in the
broadest context of technological change.
2.3 Program Specific Outcomes (PSO):
2.3.1 PSO-1: To demonstrate the knowledge of computer science to implement
programming concepts and deliver efficient solutions for emerging challenges in
the computational domain
2.3.2 PSO-2: To inculcate professional, social, ethical, and entrepreneurial practices to
solve real world problems in various domains.

CO-PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 3 2 1
CO2 3 3 2 3 2 1
CO3 3 3 2 3 2 1
CO4 3 3 2 3 2 1

3. Teaching-learning methodology
3.1 Instruction Plan
Assessment
Teaching COs
Lecture Blooms Resources and
Topic mapped
No. Method * Level Evaluation

Unit 1: Introduction to OR

Origin of OR and its

definition. Concept of
optimizing performance Class Test-1
T1: sec 1.1-
measure, Types of OR PPT, CO3 and TEE
1 REMEMBER 1.5, pp. 1-9
problems, Deterministic Whiteboard
vs. Stochastic optimization,
Phases of OR problem
approach.
Unit 2: Linear Programming Problem

Linear programming – T1: sec 2.1-

2 Examples from industrial REMEMBER 2.5, pp. 31- CO1
cases, 33

3 Implicit assumptions of LPP. T1: sec 1.7,

APPLY
p. 15 CO1
Course Policy Operations Research

Formulation & definitions,

Matrix form. Convex
4 polyhedron, Extreme T1: sec 2.6,
APPLY
pp.36-38 CO1
Points, Basic feasible
solutions.

Hyperplane, Convex set,

Graphical method: Special
5 Cases – infeasibility, T1: sec 2.9,
APPLY
p.86 CO1
unboundedness, redundancy
& degeneracy.

Simplex Algorithm – T1: sec

6 APPLY 2.16,
computational details, Big-M CO1
pp.148-158
Lab
Submission
Method, identification and
T1: sec and Class
7 resolution of special cases APPLY
2.18, p.168 CO1 Test-1 and
through simplex iterations.
TEE

Sensitivity analysis. Duality

– formulation, results, dual- T1: sec
8 APPLY
simplex and primal-dual PPT, 2.18, p.191 CO1
algorithms. Whiteboard

Unit 3: Integer Programming Problem

Introduction of Integer T2: sec 9.1,

9 APPLY
Programming p.350 CO1

Gomory cutting plane T2: sec Lab

10 EVALUATE
Submission
method, 9.2.2, p.379 CO1
and Class
PPT,
Test-1 and
Whiteboard
Branch and bound algorithm, T2: sec TEE
11 EVALUATE
9.2.1, p.370 CO1

Integer Programming T2: sec 9.3,

12 EVALUATE
p.385 CO1
Problem applications.

Unit 4: Transportation and Assignment problems

Transportation Problems - T1: sec 3.1-

13 APPLY 3.3,
Formulation, minimization CO2
pp.212-213
and maximization models,
Course Policy Operations Research

Solution methods – NWCR, T1: sec 3.4

14 EVALUATE
pp.218-223 CO2
Least cost and VAM,

Test for optimality (MODI T1: sec 3.4

15 EVALUATE
method), pp.223-225 CO2

Variations in Transportation
problem (Unbalanced, T1: sec 3.4
16 EVALUATE
Degeneracy, Alternate pp.225-231 CO2
solution, Prohibited routes)

Assignment Problem -
T1: sec 4.1 Lab
17 Formulation, Balanced & EVALUATE
pp.299-301 CO2 Submission
unbalanced situations,
and Class
Hungarian method,
PPT, Test-2 and
Variations in Assignment Whiteboard TEE
problem (Multiple solution, T1: sec 4.5
18 EVALUATE
Maximization case, pp.303-317 CO2
Restrictions on assignment).

Unit 5: Network Analysis

CPM Project definition,

19 UNDERSTAND T1: sec
Project scheduling CO3
14.8, p.962
techniques –PERT

T1: sec
20 Project scheduling APPLY
14.10, CO3
techniques –CPM, pp.973-987

T1: sec
Determination of critical PPT, 14.11,
21 APPLY
paths, Whiteboard CO3 Lab
pp.994-
1009 Submission
T1: sec and Class
Estimation of Project time
22 14.11, Test-2 and
and its variance in PERT APPLY
CO3
using statistical principles, pp.994- TEE
1010
T1: sec
23 Concept of project APPLY 14.18,
CO3
crashing/time-cost trade-off. pp.1066-
1068
Unit:6 Game Theory
T1: sec
Introduction - Characteristics PPT,
24 APPLY 10.1-10.3,
of Game Theory, Whiteboard CO4
pp.712-715
Course Policy Operations Research

T1: sec
Two-person zero-sum games
25 EVALUATE 10.9-10.10,
with saddle-points, CO4
pp.721-733

T1: sec
Two-person zero-sum games
26 EVALUATE 10.11,
without saddle-points, CO4
p.745

T2: sec
27 Pure and mixed strategies. EVALUATE
14.2, p.430 CO4

Unit 7: Simulation Methodology

T1: sec
Definition and steps of 16.1,
28 APPLY
simulation, random number, pp.1112- CO3
1114

Discrete Event System

Simulation– clock, event list, T1: sec
29 Application in Scheduling, APPLY 11.2-11.8, CO3
Queuing systems and pp.777-783
PPT,
Inventory systems. Whiteboard

Introduction, Processing n
jobs through two machines, T1: sec
30 Processing n jobs through 3 APPLY
11.8, CO3
machines, Processing n jobs pp.783-819
through m machines.

Lab

4. Assessment and Evaluation Scheme

Internal Continuous Assessment (ICA) (50 Marks)

Class Tests (20 Marks) Term-work (30 Marks)

Assessment Class Test-1 Class Test-2 Lab examination + Lab. work Mini Project/Quiz
Component Viva
Marks 10 10 15 10 5

4.1 Internal Continuous Assessment (ICA) – 50 marks

Class Test-1 conducted in the 6th week. It will be for10 marks (45 minutes duration).
Class Test-2 conducted in the 11th week. It will be for 10 marks (45 minutes
duration). Lab exam will have a weightage of 15 marks for ICA. Laboratory test will
be conducted based on the concepts learnt and exercises done in the lab, on software
and manually. Viva will be based on the lab test and other relevant topic. Evaluation
based on timely submissions of lab work given every week. It will carry a weightage
Course Policy Operations Research

of 10 marks. Evaluation based on timely submission. 50% marks would be

deducted for late submissions. (It is important that all assignments and lab
submissions are done before the deadline given). In the challenging activity,
students will be either allotted Mini Project/Quizzes with 5 marks weightage.
4.2 Term End Examination (TEE) – (100 marks scaled down to 50)
TEE conducted at the end of the semester will be for 100 marks (3-hour duration).
Marks obtained scaled down to 50. There will be 7 questions (each question will be
20 marks). Q1 will be compulsory and any 4 from the remaining to be solved.
4.3 Course Passing Criteria
4.3.1 ICA (50 marks) – No minimum marks
4.3.2 TEE (100 marks scaled to 50) – 40% required for passing
4.3.3 (ICA + TEE) (100 marks) - 50% required for passing
4.4 Assessments and Mapping to Course Outcomes

Internal Continuous Assessment (ICA) Term End

Examination
(TEE)
Course CT-1 CT-2 Lab. Exam + viva Lab. work Mini TEE
Outcomes Project/Quiz
CO-1 Y Y Y Y Y
CO-2 Y Y Y Y Y Y
CO-3 Y Y Y Y Y

5. Laboratory details
The following 10 lab experiments will form the submission for laboratory coursework.

Exp. Mapped
Week No.# List of Experiments
No. CO

1. Week 2 Graphical method: Conducting iterations to solve LP problems. CO1

Week 3 Simplex method: Conducting iterations to solve LP problems. CO1

2.

Week 4 LPP: Duality & Two-Phase Simplex Problems. CO2

3.

Week 5 Solve a problem based on Integer Programing. CO2

4.

5. Week 7 Transportation Problem: Finding initial basic feasible solution using CO 2

Vogel's Approximation Method. Testing the solution using MODI
Course Policy Operations Research

method for optimality.

Assignment Problem: Using Hungarian Method to assign tasks to

CO 2
6. Week 8-9 resources optimally.[Restrictions on assignment]

Network Analysis: Critical Path Method (CPM): Identifying the critical CO 1

7. Week 10-11
path in a project network.
Network Analysis: Program Evaluation and Review Technique (PERT): CO 3
8. Week 12-13
Incorporating probabilistic time estimates in network analysis.
Solve a problem on two persons zero-sum game with and without saddle CO 3
9. Week 14
point.
Sequencing: n jobs on two machines, n jobs on three machines and n CO 3
10. Week 15
jobs on m machines.

6. Course Material
References and Lab Assignments would be uploaded on LMS by faculty every week.

7. Gen AI Usage
7.1 Pre-class Activity:
 Application of Operations Research
 Role of Software Engineer in this domain
7.2 In-Class Activity:
1. Use GenAI to find industry examples of optimization using Linear Programming
and its limitations.
2. Use GenAI to find examples of simulation methodology except for production.
3. Use GenAI to find examples of Network Analysis in Computer Engineering.
7.3 Assignments
GenAI is not to be used for doing Lab work given by faculty.
7.4 Challenging Problems (Mini Project)
GenAI is permitted to be used. Students need to cite the references used.

8. Academic Integrity Statement

Original work expected from students for all of the assigned assessment work. Copying in
any form not acceptable and will invite strict disciplinary action. Evaluation of
corresponding component will be affected proportionately in such cases. Plagiarism
Course Policy Operations Research

detection software will be used to check plagiarism wherever applicable. Academic integrity
is expected from students in all components of course assessment.

* - Only Teaching Method in the Instruction Plan for the course may vary
for different faculty teaching the course, rest of the Course Policy
Document will not change.