ME ----- Operations Research

Module Number : ME -----Module Title: Operations Research

Credit Hours: 3
ESTC: 6
Contact Hours: 3 Lecture

Module objectives:
- Understand the major capabilities and limitations of operations
research modeling as applied to problems in industry or government.
- Be able to recognize, formulate and, using prepared computer
packages, solve allocation models of static or dynamic type.
- Understand the reasons why the applicable algorithms work, and the
effects on the computed solutions of variations in the data or in the
assumptions underlying the models.
- Be able to communicate the results of the modeling process to users
who are not operations research specialists.
Module description:
This module covers quantitative models commonly used in business and
industries. Topics include linear programming, transportation, assignment,
and transshipment problems; integer linear programming; network models;
conditional probability; markov chain; waiting line models; decision analysis;
multicriteria decision problems; and dynamic programming. Examples of
business application will be used to establish the relevancy of the models.
Module outline:
1. Introduction of operations Research
2. Introduction to Linear Programming: Application and Model
formulation; The Graphical solution method; The Simplex solution
Method; Duality and sensitivity analysis
3. Integer Programming: The integer programming model; Total
integer programming model; A 0-1 integer programming model; Mixed
integer programming model
4. Decision Analysis and Game Theory: Decision making under
certainty; Decision making under uncertainty; Game Theory
5. Markov Analysis: Characteristics of Markov analysis: Application of
Markov analysis; State and transition probabilities
6. Nonlinear and Dynamic programming: The Dynamic programming
solution approach; Nonlinear programming model and solution
methods
7. Network Models: Introduction to Networks; The transportation Model
and solution methods; The assignment model and solution methods;
Shortest route problem and solution approach; The minimal spanning
tree problem and solution approach; The maximal flow problem and
solution approach
Pre-requisites: SQC and Computer programming
Textbook: Bernard W. Taylor , Introduction to Management Science,
Prince Hall ,USA, 1996
References:
1. Bernard W. Taylor , Introduction to Management Science, Prince
Hall ,USA, 1996

2. Frederick S. Hillier and Gerald F. Lieberman, Introduction to

Operation Research, McGraw-Hill College, 2000
3. Hamdy A. Taha, Operations Research: An Introduction, Prentice Hall,
7th Edition 2006
4. Harvey M. Wagner, Principles of Operations Research: With
Applications to Managerial Decisions, 2nd Edition, New Delhi: PrenticeHall of India, 1998.
5. J.K. Sharma, Operations Research, Macmillan India Ltd, Delhi, 1997.
6. Jeffrey D., Management Science, south western publishing, Thomas
publishing Company, Cincinnati, Ohio, 1996.
7. John A. Applied Management Science, John Wiley & Sons Inc., New
York, 1998.
8. Monks, Joseph G. Operations Management, New York: McGraw-Hill
Inc. 1985.
9. Paul A. Jensen, Jonathan F. Bard, Operations Research Models and
Methods, Wiley, 2002
10. Wayne L. Winston, Operations Research: Applications and
Algorithms, Duxbury Press, 2003
Teaching methods:
- Lecture supported by tutorials, laboratory and assignments
- Industrial visits
Minimum attendance required to be permitted to examination:
85% lecture attendance and 100 % laboratory attendance.
Evaluation:
Assignment (20%), Project (30%), Final examination (50%)
Hours per Semester: 48