Course Policy Optimization Methods

Mukesh Patel School of Technology Management & Engineering

School of Technology Management and Engineering

Course Policy Document

Course Name - (Code): Optimization Methods (OM) – (702BS0C032)

Program and Semester: B Tech /MBA Tech (DS),

BTech / CSE (DS), semester-III and BTI (DS) semester- Pre-requisite Course : None
VII, BTech CSDS semester-III (Hyderabad and Chandigarh)
Credit Details:
Academic Year: 2025-26 L T P C H
3 0 2 4 5
Name of Course Faculty: Dr. Sheetal Gonsalves
Program: B Tech (DS), MBA Tech (DS), BTI (DS) Faculty associated with the course: -
Mumbai Campus 1. Dr. Mahesh Kale (MPSTME Mumbai)
Contact Details: [email protected] 1. Dr. M. Pradeep Kumar (STME Hyderabad)
2. Dr. Aastha Gupta (STME Chandigarh)
Office Hours: Tuesday and Wednesday 2 pm -3 pm
(MPSTME, faculty area 101, 1st floor)
Pre-Course Activity:
Using GenAI, explore the following:
1. History of Optimization Methods.
2. Find the significance of optimization in solving complex problems across various domains.
3. Identify the main timelines in the development of Optimization Methods
4. Identify how this course will help you in your career goals

Course link:
Portal Link : https://portal.svkm.ac.in/usermgmt/login

MS Teams Link:
BTech: General | AY 25-26 BTech DS OM sem-3 | Microsoft Teams
MBATech: General | AY 25-26 MBATech DS OM sem-3 | Microsoft Teams
BIT: General | AY 25-26 BTI DS OM sem-7 | Microsoft Teams

1. Introduction to the Course

1.1 Importance of the Course
1.1.1 Domain Relevance:
Optimization Methods (OM) is deeply relevant to the field of Data Science
as it equips students with advanced analytical and problem-solving skills.
Data Science involves extracting insights from large datasets, and OM
techniques are essential for optimizing processes, making data-driven
decisions, and improving system efficiencies.
1.1.2 Industry Relevance:
The lab assignments covered in this course provides students with robust
analytical tools and methodologies that are applicable across a wide range of
Course Policy Optimization Methods

industries such as manufacturing and supply chain, transportation and

logistics, healthcare, finance and economics, telecommunications, and public
sector and government, enhancing their ability to solve real-world problems.
1.2Objectives of the Course:
1.2.1 Understand problem statements and solve those using optimization theory
algorithms.
1.2.2 Develop skills to analyze real-life problem statements and implement them
using optimization techniques.

2. Course Outcomes (CO), Mapping with Program Outcomes (PO), and

Program Specific Outcomes (PSO)
2.1 Course Outcomes
2.1.1 CO1: Use optimization techniques in Data Analytics and related areas. (K2)
2.1.2 CO2: Apply optimization techniques to business problems. (K3)
2.1.3 CO3: Develop and implement basic optimization techniques. (K3)
2.1.4 CO4: Analyze and interpret optimization results to support decision-making
processes. (K4)
2.1.5 CO5: Analyze real-world problems and construct suitable optimization models.
(K4)
2.1.6 CO6: Apply optimization methods using modern computational tools. (K3)

2.2 Program Outcomes(PO) the course contributed to:

2.2.1 PO1: Engineering Knowledge: Apply knowledge of mathematics, natural science,
computing, engineering fundamentals and an engineering specialization as specified
in WK1 to WK4 respectively to develop to the solution of complex engineering
problems.
2.2.2 PO2: Problem Analysis: Identify, formulate, review research literature and analyze
complex engineering problems reaching substantiated conclusions with
consideration for sustainable development. (WK1 to WK4)
2.2.3 PO3: Design/Development of Solutions: Design creative solutions for complex
engineering problems and design/develop systems/components/processes to meet
identified needs with consideration for the public health and safety, whole-life cost,
net zero carbon, culture, society and environment as required. (WK5)
2.2.4 PO4: Conduct Investigations of Complex Problems: Conduct investigations of
complex engineering problems using research-based knowledge including design of
Course Policy Optimization Methods

experiments, modelling, analysis & interpretation of data to provide valid

conclusions. (WK8).
2.2.5 PO5: Engineering Tool Usage: Create, select and apply appropriate techniques,
resources and modern engineering & IT tools, including prediction and modelling
recognizing their limitations to solve complex engineering problems. (WK2 and
WK6)
2.2.6 PO6: The Engineer and The World: Analyze and evaluate societal and
environmental aspects while solving complex engineering problems for its impact
on sustainability with reference to economy, health, safety, legal framework, culture
and environment. (WK1, WK5, and WK7).
2.2.7 PO7: Ethics: Apply ethical principles and commit to professional ethics, human
values, diversity and inclusion; adhere to national & international laws. (WK9)
2.2.8 PO8: Individual and Collaborative Team work: Function effectively as an
individual, and as a member or leader in diverse/multi-disciplinary teams.
2.2.9 PO9: Communication: Communicate effectively and inclusively within the
engineering community and society at large, such as being able to comprehend and
write effective reports and design documentation, make effective presentations
considering cultural, language, and learning differences
2.2.10 PO10: Project Management and Finance: Apply knowledge and understanding of
engineering management principles and economic decision-making and apply these
to one’s own work, as a member and leader in a team, and to manage projects and
in multidisciplinary environments.
2.2.11 PO11: Life-Long Learning: Recognize the need for, and have the preparation and
ability for independent and life-long learning ii) adaptability to new and emerging
technologies and iii) critical thinking in the broadest context of technological
change.

Annexure I: Knowledge and Attitude Profile (WK)

WK1: A systematic, theory-based understanding of the natural sciences applicable

to the discipline and awareness of relevant social sciences.
WK2: Conceptually-based mathematics, numerical analysis, data analysis, statistics
and formal aspects of computer and information science to support detailed analysis
and modelling applicable to the discipline.
Course Policy Optimization Methods

WK3: A systematic, theory-based formulation of engineering fundamentals

required in the engineering discipline.
WK4: Engineering specialist knowledge that provides theoretical frameworks and
bodies of knowledge for the accepted practice areas in the engineering discipline;
much is at the forefront of the discipline.
WK5: Knowledge, including efficient resource use, environmental impacts, whole-
life cost, reuse of resources, net zero carbon, and similar concepts, that supports
engineering design and operations in a practice area.
WK6: Knowledge of engineering practice (technology) in the practice areas in the
engineering discipline.
WK7: Knowledge of the role of engineering in society and identified issues in
engineering practice in the discipline, such as the professional responsibility of an
engineer to public safety and sustainable development.
WK8: Engagement with selected knowledge in the current research literature of the
discipline, awareness of the power of critical thinking and creative approaches to
evaluate emerging issues.
WK9: Ethics, inclusive behavior and conduct. Knowledge of professional ethics,
responsibilities, and norms of engineering practice. Awareness of the need for
diversity by reason of ethnicity, gender, age, physical ability etc. with mutual
understanding and respect, and of inclusive attitudes.

2.3 Program Specific Outcomes (PSO):

At the end of the program, the student should have the ability to:

2.3.1 PSO1: clean, process, visualize and analyze all types of structured and unstructured
data

2.3.2 PSO2: move towards an interdisciplinary approach for solving problems using
knowledge of Mathematics, Statistics, Computing Algorithms in one or more
selected domains such as Healthcare, Agriculture, Telecom, Retail, Manufacturing,
Engineering Sciences, and Management.

2.3.3 PSO3: design, develop and implement Data Science and Artificial Intelligence
applications for resource constrained environments.
Course Policy Optimization Methods

CO-PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2 PSO3

CO1 3 3 2 2 3 2

CO2 3 3 2 2 3 2

CO3 3 3 2 2 3 2

CO4 3 3 2 2 3 2

CO5 3 3 2 2 2 3 2

CO6 3 3 2 2 2 3 2

Mapping Levels: 3- High, 2-Medium, 1-Low

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

Unit 1: Linear Programming

T1: sec 3.1,

pp. 69-85,
Sec 3.4, Lab
Introduction to LPP, pp 87-92 Submission
Graphical Method: CO1,2,3
1 APPLY and Class
Maximization, Minimization ,5
Test-1 and
case
TEE

Lab
T1: sec 4.1, Submission
Simplex Method: CO1,2,3
2 PPT, UNDERSTAND pp. 101- and Class
Maximization case Whiteboard ,5
107. Test-1 and
TEE

Lab
T1: sec 4.2, Submission
Simplex Method: CO1,2,3
3 APPLY pp. 108- and Class
Maximization case ,5
112. Test-1 and
TEE

Lab
T1: sec 4.3, Submission
Simplex Method: CO1,2,3
4 APPLY pp. 108- and Class
Maximization case ,5
112. Test-1 and
TEE
Course Policy Optimization Methods

Big M Method, Lab

T1: sec 4.4, Submission
Two Phase Simplex Method: CO1,2,3
5 UNDERSTAND pp. 114- and Class
Maximization, Minimization ,5
127. Test-1 and
case
TEE

Big M Method, T1: sec 4.5, Lab

pp. 132- Submission
Two Phase Simplex Method: CO1,2,3
6 APPLY 139. and Class
Maximization, Minimization ,5
Test-1 and
case
TEE

T1: sec
5.1-5.2, CO1,2,3 Class Test-1
7 Concept of Primal and Dual UNDERSTAND
pp. 146- ,5 and TEE
151.

T1: sec
Sensitivity Analysis, 6.1- 6.2, CO1,2,3 Lab
8 APPLY
Karmakar's Method pp. 170- ,4,5,6 Submission
196.

Unit 2: Transportation Problem

Introduction to T1: sec

Transportation Problem and 9.1- 9.2,
9 UNDERSTAND CO1,2,3
Formulation of Mathematical pp. 257- ,5
Model 259.

Introduction and problem

solving by NWCM, VAM T1: sec
9.3- 9.4, CO1,2,3
10 methods to find initial APPLY
pp. 259- ,5
feasible solution
264.
for the TP

Introduction and problem

solving by VAM T1: sec 9.6, Lab
11 method to find initial feasible APPLY pp. 280- CO1,2,3 Submission
solution for the TP PPT, 283. ,5 and Class
(unbalanced TP) Whiteboard
Test-1 and
TEE
Introduction and problem
T1: sec 9.5,
solving by MODI
12 APPLY pp. 266- CO1,2,3
method to find the optimum
277. ,5
solution for the TP

T1: sec 9.5,

13 TP: find the optimal solution APPLY pp. 266- CO1,2,3
277. ,5

problem solving by MODI

method to find T1: sec 9.6,
14 APPLY pp. 283- CO1,2,3
optimum solution for
290. ,5
degenerate cases
Course Policy Optimization Methods

Unit 3: Assignment Problem

Introduction to Assignment T1: sec

Problem and 10.1- 10.2,
15 APPLY CO1,2,3
Formulation of Mathematical pp. 311-
,5
Model 312.

Introduction and problem T1: sec

solving by Hungarian 10.3,
16 APPLY CO1,2,3 Lab
Method / Flood’s technique pp. 312- ,5
317. Submission
to find optimum solution
and Class
Test-2 and
Introduction and problem PPT, T1: sec
TEE
Whiteboard 10.4, CO1,2,3
17 solving for Unbalanced APPLY
pp. 323- ,5
Problem in AP 326.

Introduction and problem T1: sec

solving for maximization 10.4, CO1,2,3
18 APPLY
pp. 320-
cases in AP ,5
323.

Introduction and solution for T1: sec

10.6, Class Test-2
19 Traveling Salesman UNDERSTAND CO1,2,3
pp. 331- ,5 TEE
Problem 334.

Unit 4: Decision Making Problem

Introduction to conditions of T1: sec 11,

20 Certainty, Uncertainty and UNDERSTAND pp. 430- CO1,2,3
Risk 434. ,4,5

Introduction to MaxiMax, T1: sec 11,

21 MaxiMin, Minimax, APPLY pp. 430- CO1,2,3
Hurwicz and Laplace Criteria 439. ,4,5 Lab
PPT, Submissions
Whiteboard
, Class Test-
T1: sec 11, 2 and TEE
Introduction to EMV, EOL
22 APPLY pp. 439- CO1,2,3
and EVPI Calculations
451. ,4,5

Problems based on EMV, T1: sec 11,

23 APPLY pp. 439- CO1,2,3
EOL and EVPI ,4,5
451.

Unit 5: Game Theory

PPT, T1: sec 12,

24 Introduction to Game Theory Whiteboard UNDERSTAND pp. 480- CO1,2,3 Class Test-2
505. ,4,5 and TEE
Course Policy Optimization Methods

T1: sec 12, Lab

Problems solving when
25 APPLY pp. 480- CO1,2,3 Submissions
saddle point exists ,4,5
505.

Problems solving when

saddle point does not exists T1: sec 12,
26 using Principle of APPLY pp. 480- CO1,2,3
Dominance (Arithmetic 505. ,4,5
method)

Problems solving when

saddle point does not exists T1: sec 12,
27 using Principle of APPLY pp. 480- CO1,2,3
Dominance (Arithmetic 505. ,4,5
method)

Unit 6: Simulation Modeling

Introduction, advantages,
limitations, and applications T1: sec 19,
28 of Simulation, UNDERSTAND pp. 853- CO1,2,3
Introduction to Random 865. ,5,6
Number Generation

T1: sec 19,

Problem solving using
29 APPLY pp. 853- CO1,2,3
Random Number Generation PPT, 865. ,5,6 Class Test-2
Whiteboard
and TEE

T1: sec 19,

problem solving using Monte
30 APPLY pp. 853- CO1,2,3
Carlo Simulation
865. ,5,6

problem solving using Monte T1: sec 19,

31 APPLY pp. 853- CO1,2,3
Carlo Simulation ,5,6
865.

Unit 7: Goal Programming

T1: sec 8,
Introduction and
32 UNDERSTAND pp. 291- CO1,2,3
Mathematical Formulation 316. ,5,6

Lab
PPT, T1: sec 8, Submissions
Goal Programming CO1,2,3
33 Whiteboard UNDERSTAND pp. 291-
and TEE
:Mathematical Formulation 316. ,5,6

Problems based on Goal T1: sec 8,

34 Programming using APPLY pp. 291- CO1,2,3
graphical method 316. ,5,6
Course Policy Optimization Methods

Problems based on Goal T1: sec 8,

35 APPLY pp. 291- CO1,2,3
Programming ,5,6
316.

T1: sec 8,
36 Problems based on Goal CO1,2,3
APPLY pp. 291-
Programming 316. ,5,6

Unit 8: Integer Linear Programming and Mix Integer Programming Problems

T1: sec 7,
37 Introduction, Mathematical CO1,2,3
UNDERSTAND pp. 249-
Formulation 267. ,5,6

Introduction to Gomory’s
Cutting Plane algorithm (all T1: sec 7,
38 integer case) and APPLY pp. 249- CO1,2,3
problem solving for different 267. ,5,6
cases

Problem solving using T1: sec 7,

39 Gomory’s Cutting Plane APPLY pp. 249- CO1,2,3
algorithm (all integer case) 267. ,5,6

Problem solving using T1: sec 7,

40 Gomory’s Cutting Plane APPLY pp. 249- CO1,2,3 Lab
algorithm (all integer case) PPT, 267. ,5,6 Submissions
Whiteboard
and TEE
Introduction to Branch and
Bound algorithm (Graphical T1: sec 7,
41 method) and APPLY pp. 275- CO1,2,3
problem solving for different 281 ,5,6
cases

Introduction to Branch and

Bound algorithm (Graphical T1: sec 7,
42 method) and APPLY pp. 275- CO1,2,3
problem solving for different 281 ,5,6
cases

Introduction to Branch and

Bound algorithm (Graphical T1: sec 7,
43 method) and APPLY pp. 275- CO1,2,3
problem solving for different 281 ,5,6
cases
Course Policy Optimization Methods

Text Books
T1: J. K. Sharma, Operations Research: Theory and Applications, 6th Edition,
MacMillan, 2017.
T2: Bernard W. Taylor III, Introduction to Management Science, 13th Edition,
Pearson, 2018.
Reference Books
R1: Prem Kumar Gupta and D S Hira, Operations Research, Revised edition, Sultan Chand Publications,
2017.
R2: Hamdy D Taha, Operations Research, 8th Edition, Prentice Hall, 2017.
R3: S. S. Rao, Engineering Optimization, 3rd Edition, Prentice Hall, 2017.

4. Assessment and Evaluation Scheme

Internal Continuous Assessment (ICA) (50 Marks)

Class Tests Term-work

(20 Marks) (30 Marks)

Assignments / Case
Assessment Class Class Lab Class
Lab Test studies/ activity on
Component Test-1 Test-2 Performance participation
research paper

Marks 10 10 10 5 10 5

4.1 Internal Continuous Assessment (ICA) – 50 marks

Class Test-1 conducted in the 6th week. It will be for 10 marks. Class Test-2 conducted
in the 12th week. It will be for 10 marks. Lab submissions and one Lab Test will have
a weightage of 10+5 marks for ICA. Evaluation based on timely submissions of lab
work given every week. Assignments / Case studies / activity on research paper will
carry a weightage of 10 marks. Class participation will have a weightage of 5 marks
for ICA. Assessment of the lab work will be carried out based on parameters like timely
completion of lab work file, understanding of the experiment performed, originality in
the work, involvement of the student, regularity, discipline etc. during the session.
25% marks would be deducted for late submissions. (It is important that all
assignments and lab submissions are done before the deadline given). The Lab
Test will carry a weightage of 5 marks.
4.2 Term End Examination (TEE) – (100 marks scaled down to 50)
Course Policy Optimization Methods

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) - 40% 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 Assignments / Case Lab Class TEE
Outcomes Submissio studies/ activity on Test participation
ns research paper
CO-1 Y Y Y Y Y Y Y
CO-2 Y Y Y Y Y Y Y
CO-3 Y Y Y Y Y Y Y
CO-4 Y Y Y Y Y Y Y
CO-5 Y Y Y Y Y Y Y
CO-6 Y Y Y Y

5. Laboratory details
Knowledge of Excel for laboratory exercise is a prerequisite. Students are expected to recall
the fundamental theory concepts relevant to the exercise to be performed in the upcoming
laboratory.
Laboratory coursework involves creating optimization models in Excel and analyzing the
output for real-world problems, examples that relate to topics that the students have seen (or
will see) elsewhere in the curriculum.
Following methodology will be used for each lab:
1. Problem Formulation:
Observe system and summarize problem situation
Identify problem for analysis
Define problem
2. Model Development:
Construct a mathematical model
Find preferred solution
Course Policy Optimization Methods

Verify model and test performance

Analyze sensitivity of solution
3. Implementation:
Generate report and demonstrate model
Establish control over solution

● Textbook Resources: Download the software (Excel QM and QM for Windows)

that accompanies our textbook, as well as example files and online modules.
https://media.pearsoncmg.com/ph/bp/bridgepages/bp_taylor_bridgepage/taylor_13e/st
udent_resources.html

The following 10 Lab exercises will form the submission for laboratory coursework.

Exp. Week
Topic Mapped CO
No. No.#

Week 1 Basic Excel / QM software

1 Week 2 LP Models: Graphical Solutions CO 1,2,3,4,5,6

2 Week 3 LP Modelling & Sensitivity Analysis CO 1,2,3,4,5,6

3 Week 4 CO 1,2,3,4,5,6
LP Modelling / Simplex method /Excel solver/QM

Transportation Problems: TP Models CO 1,2,3,4,5,6

4 Week 5
Solving the problems of TP using Excel solver

Solving TP Models CO 1,2,3,4,5,6

5 Week 6
Solving the problems of TP/AP and verify using Excel
solver/QM

Assignment Problems: AP Models CO 1,2,3,4,5,6

6 Week 7
Solving the problems of AP using Excel

Solving AP Models CO 1,2,3,4,5,6

7 Week 8
Solving the problems of TP/AP and verify using Excel
solver/QM

Week 9 Lab Test CO 1,2,3,4,5,6

Course Policy Optimization Methods

8 Week 10 Decision Analysis: Decision Models CO 1,2,3,4,5,6

9 Week 11 Game theory CO 1,2,3,4,5,6

Integer Programming: ILP, MILP Models CO 1,2,3,4,5,6

10 Week 12
Solving the problems of ILP using Excel solver

Integer Programming: ILP, MILP Models CO 1,2,3,4,5,6

11 Week 13
Solving the problems of ILP using Excel solver

Goal Programming CO 1,2,3,4,5,6

12 Week 14
Solving the problems of Goal Programming using Excel
solver.

Week 15 Submission

6. Tutorial Plan
This course does not have any tutorial.

7. Course Material
References and Lab Manuals would be uploaded on LMS by faculty every week.

8. GenAI Usage
8.1Case Studies and Applications
● Research and summarize at least two real-world case studies where
optimization methods were successfully applied to solve a problem
● Explain the methodologies used and the impact of optimization in these cases.
8.2Current Trends and Future Directions
● Identify current trends in optimization methods and discuss emerging areas of
research and application.

9. Academic Integrity Statement

Original work expected from students for all of the assigned assessment work. Copying in
any form is not acceptable and will invite strict disciplinary action. Evaluation of
Course Policy Optimization Methods

corresponding components will be affected proportionately in such cases. Plagiarism detection

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