Jordan University of Science and Technology
College of Computer and Information Technology
Department of Computer Science and Information Systems
IS383 " Operations Research"
Summer Session 05
COURSE OBJECTIVES
Instructor : Dr. Mohammad Al-Towaiq.
Office Hours : Every Day from 9:30 – 10:30 OR by APPOINTMENT.
Prerequisite : CS112 and MATH233.
Text Book : H. A. Taha, "Operations Research An Introduction", Sixth Ed., Prentice-Hall, 1997.
Assessment :
- First Exam : 20 % Week 3.
- Second Exam : 20 % Week 6.
- Quizez(4): 20 % TBA.
- Final Exam :40 % TBA.
COURSE OBJECTIVES
- Our objectives are:
- To give the central facts and ideas of Operations Research, and show how they are used in various models which arise in applied and theoritical investigation.
- To show the importance of structured models by formulating and analyzing the models in many context.
- To employ the proper computational techniques to solve these problems.
- To provide student with an impressive illustration of how simple mathematics can be used to solve difficult problems which arise in real situations and to give them tools which will prove useful in their professional work.
COURSE SYLLABUS:
Subject Chapter Week /Date
| Overview of Operations Research: What is Operations Research?, Development of Operations Research, Phases of an Operations Research study. |
1 |
1
July 3 - 7 |
| Introduction to Linear Programming: Linear Programming Problem, Graphical Solution, Generating Extreme-Point Solutions, Examples. |
2 |
Cont. Week 1 |
| The Simplex Algorithm: Development of a Minimum Feasible Solution, Computational Procedure, The Artificial-Basis Technique, A First Feasible Solution Using Slack Variables, Degeneracy and the Convergence of the Simplex Algorithm, Two Phase Simplex Method, Unrestricted-In-Sign Variables, Duality, the Dual Simlex Algorithm, Sensitivity Analysis, the LINDO Computer Package, Matrix Generators, LINGO, and Scaling of LPs, Solving LPs with Spreadsheets. |
3 |
2 + 3 + 4 July 10 – 28 |
| The Transportation Model: Definition, the Transportations Algorithm. |
5 |
5
July 31 –Aug.4 |
| Network Models: Definition, Minimal Spanning Tree Algorithm, Shortest Rout Problem, Maximal Flow Model, Minimum-Cost Capacitated Flow Problem |
6 |
Cont. Week 5 |
| Markov Chains: What is a Markov Chain?, n-Step Transition Probabilities, Classification of States in Markov Chain, Steady-State Probabilities and Mean First Passage Times, Absorbing Chains. |
19 fromRef(1) Winstom |
6
Aug 7 - 11 |
| Queueing Systems: Why Study Queues?, Elements of a Queueing Model, Role of Exponential Distribution. |
17 |
7
Aug. 14 - 18 |
REFERENCES
- W.L.Winston “Operations Research”, 2nd. ed., ITP, 1995
- F. Hillier and G. Lieberman " Introduction to Operations Research ", 5th ed., MacGraw-Hill, 1990.
- A. Ravindran, D. Phillips and J. Solberg " Operations Research: Principles and Practice ", 2nd ed.,John Wiley, 1987.
Top
No lecture notes available until now.
Top
No info available until now.
Top
No info available until now.
Top
|
