Fall-2023 OR CIS
Fall-2023 OR CIS
COURSE OBJECTIVE:
In particular, linear programming, dynamic programming and queuing models. Formulate a real-world
problem as a mathematical programming model. Understanding the theoretical workings of the simplex
method for linear programming and perform iterations of it by hand. Understanding the relationship
between a linear program and its dual, including strong duality and complementary slackness. Performing
sensitivity analysis to determine the direction and magnitude of change of a model’s optimal solution as the
data change. Solving specialized linear programming problems like the transportation and assignment
problems. Solving dynamic programming problems. Game theory problems. PERT-CPM problems.
COURSE OUTLINE:
Introduction, Modeling a Problem, Concept of Optimization, Linear Programming, Simplex and Duality
Concepts, Transportation and Assignment (Scheduling) Problem, Dynamic Programming, Game Theory,
PERT/CPM.
Bloom’s
CLO # CLO Statement PLOs
Taxonomy
Explain the concepts and characteristics of PLO_2
different types of linear programming (Knowledge for C2
CLO 1
problems , extreme points and convex solving computing (Understand)
analysis problem)
Execute real life scenarios of simplex PLO_3
C3 (Apply),
CLO 2 problems and duality problems. Select (Problem Analysis)
C5 (Evaluate)
Transportation Model for real life scenarios
Page 1 of 4
(SSUET/QR/111)
SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY
SOFTWARE ENGINEERING DEPARTMENT
that fulfills supply and demand and
Assignment Models.
GRADING POLICY:
Recommended Book:
Reference Books:
Page 2 of 4
(SSUET/QR/111)
SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY
SOFTWARE ENGINEERING DEPARTMENT
LECTURE PLAN
Course Title: Operations Research
Course Code: SWE-317T
Week Required
Week Dates Topics Key Date
No. Reading
1 09-10-2023 Introduction to Operation Research, Fred-Chap 1:
to Methodology of Operation Research pg. 1
13-10-2023 Fred-Chap 1:
Pg. 2-3
2 16-10-2023 Linear Programming, Convex Analysis, Fred-Chap 1:
to and Polyhedral Sets, Dilemma of an Pg. 4-5
20-10-2023 Astronaut Problem, Graphical solution of Fred-Chap 2:
two-variables linear programming Pg. 8
problems Fred-Chap 2:
Pg. 11-13,16-
19
3 23-10-2023 Convex Set, Extreme Points, Linear Fred-Chap 3:
to Function, Linear Inequalities, Linear pg. 24-30,36
27-10-2023 Programming Problem Fred-Chap 3:
pg. 42
4 Fred-Chap 3: Assignment #
30-10-2023 Toy Company Manufacturer's Problem,
pg. 24-30, 36 1
to Optimization Model, The Simplex
Fred-Chap 3:
03-11-2023 Algorithm, Slack Variable
pg. 42
5 06-11-2023 Definition of a basic solution and feasible Fred-Chap 4:
to solution, Theorems, Steps for Simplex pg. 89-107
10-11-2023 Algorithm, Fred-Chap 5:
Pg.94-97, 161-
171
Page 3 of 4
(SSUET/QR/111)
SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY
SOFTWARE ENGINEERING DEPARTMENT
9
Midterm Examination
(04-12-2023 to 09-12-2023)
10 11-12-2023
Transportation Problem, Finding basic Fred-Chap 8:
to Assignment#
feasible solution of Transportation pg. 305-319
15-12-2023 2
Problem, North-West Corner Method Fred-Chap 8:
(NWC) pg. 306-319
11 18-12-2023 Least Cost Method (LCM), Vogel's Fred-Chap 8: Quiz # 2
to Approximate Method, The Assignment pg. 305-319
22-12-2023 Problem with Hungarian algorithm Fred-Chap 8:
pg. 334
12 25-12-2023 Prototype for dynamic Programming, Fred-Chap 10:
to Characteristics of Dynamic Programming pg. 424
29-12-2023 Problems Fred-Chap 10:
pg. 429
Final Examination
(29-01-2024 to 10-02-2024)
Page 4 of 4