Scribd
Upload
25 views

Operations Research

Outline OR UOG

Uploaded by

chudarybushra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views

Operations Research

Outline OR UOG

Uploaded by

chudarybushra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Title Operations Research

Code ?

Instructor Name ?

3
Theory/week:
Weight 3 Cr. Hrs.
Credit Hours Contact Hours 3 Hrs.
Lectures: 2
Duration 1.5 Hrs.

Prerequisite
None

Prerequisite
Skill/Knowledge/U o Students have concepts of computer science.
nderstanding

Category IT-Supportive

Upon successful completion of this course the students will be able to:
 Formulate a real life situation into a mathematical model
 Develop an optimal solution for the problem using appropriate
algorithm
Course Goals
 Interpret the optimal solution, and perform post-optimality anal-
ysis
 Develop mathematical insight for popular algorithms developed
to solve mathematical programs

 Operations research has had an increasingly great impact on the


management of organizations, including business, government,
and military. Operations research involves formulation of real
Statement of life situations into mathematical models, and then developing
Course Need optimal solutions by application of various algorithms. The pur-
pose of this course is to provide an appreciation of various tech-
niques used in operations research, and their application in de-
veloping optimal solutions for real life problems.
1. Learn the characteristics of different types of decision
making environments, appropriate decision making approaches
and tools to be used in each type.
Learning
Outcomes 2. Solve the Transportation Models and Assignment Models.
3. Understand the basic methodology for the solution of linear
programs and integer programs.

Introduction to operations research, History of operations research,


Applications, Modeling the linear programming, Linear programming,
Geometry, Solving the linear programming, the Simplex method,
Shadow price, Theory of the simplex method, Duality, Dual theory,
Sensitivity analysis, Other algorithms for linear programming, The dual
simple method, Big – M method, The tow phase method, The
Syllabus transportation and assignment problems, The transportation problem, A
streamlined simplex method for transportation problem, The
assignment problem, A special algorithm for the assignment problem,
Dynamic programming, Characteristic of dynamic programming,
Deterministic dynamic programming, Integer programming, Prototype
examples, BIP applications and formulation examples, Some
perspectives on solving integer programming problems, The branch-
and-cut approach to solve BIP problems, The incorporation of
constraint programming.

1. Frederick S. Hiller, Gerald J. Lieberman, Introduction to


Text Book/s Operations Research, 9th Edition, English, McGraw-Hill,
2010. 2

2. W. Winston, Operations Research, Duxbury Press.


Reference
Books/Material 3. Operations Research: Applications and Algorithms, Wayne
L Winston, Indian University, 4th edition, 2004

Instructional None
Aids/Resources
Sessional Mid Final Total
25% 25% 50% 100%

Quizzes Paper: Paper


Assessment 05 25 50
Criteria Project
10

Assignment and
Presentations 05

Project is the compulsory part of this Course.


Marks division for sectional or project may vary on the basis of
Recommendations complexity of project or available time for project execution and
documentation.

Week Source (Book-Chapter


Lecture # TOPICS
# No)

Introduction to Operations Research (OR),


Linear Programming (LP)
1,2,3
01 1,2 LP formulations (Scheduling problems,
Handout
Transportation problems, Assignment
problems)

LP formulations (Scheduling problems,


Transportation problems, Assignment
problems)
02 3,4 3
LP formulations (Multi-period problems,
Balancing problems) Assumptions of
Linear Programming

Graphical Solutions
03 5,6 2,4
Simplex Algorithm

Simplex Method in Tabular Form


04 7,8 4
Adaptations of Simplex Algorithm

Simplex Method in Tabular Form


05 9,10 4
Adaptations of Simplex Algorithm
Big M Method, Two Phase Method
06 11,12 Use of Computer to Solve LP Models (MS 4
Excel, LINDO )

Post-optimality Analysis
07 13,14 4,5
Revised Simplex Method

Duality Theory
08 15,16 Role of Duality in Post-Optimality 6
Analysis

MID Term

The Transportation Problem, Properties of


Transportation Problem
09 17,18 Generating Basic Feasible Solutions for 7,8
Transportation problem, North-West Rule,
Vogel Approximation Method

Transportation Simplex Method


Adaptations of Transportation Simplex
10 19,20 8,23
Method
The Transshipment Problem

The Assignment Problem, Hungarian


11 21,22 Method 8,9
Network Models

Algorithm for Solving Minimum Spanning


Tree
12 23,24 Algorithm for Solving Shortest Path 9
Problems
Solving Maximum Flow Problems

Minimum Cost Flow Problem, Upper


Bound Technique, Network Simplex
13 25,26 Method 9
Program Evaluation and Review
Technique (PERT)
14 27,28 22
Activity Crashing , Cost-Time Trade-Off
Analysis

Applications of OR in Project
15 29,30 22
Management, Critical Path Method (CPM)

16 31,32 Presentations and its evaluation

Final Exam

You might also like