Oman College of Management & Technology
Department of Computer Science
Baraka, Oman
Tel. (968) 26893366
Fax (968) 26893068
503204 (Operation Research)
Class sections and Lecturers:
Section 1: 11:30 – 12:30 Sun, Tue, Thu 226
Loay AlNeamy
Instructors Office Hours:
Email:
Office Location:
Office Hours:
Website:
Loay.alneimy@omancollege.edu.om
225
Sun, Tue, Thu 10:30-11:30, 13:30-14:30
Mon, Wed 10:00 – 11:30
www.omancollege.edu.om/loay
Course Code : 503204
Course Name : Operation Research
Semester / Session : First 2015/2016
Credit Hours : 3 Hrs
Course Prerequisites : -
Course Description
This course is one of the core courses for students in Computer Science degree program. The topics
that will discuss are Linear Programming, Simplex Method, Post optimal analysis, Transportation
adman assignment problem, Networking Model and Queuing theory.
Course objectives
Providing students with conceptual and empirical understanding of OR methods and their role in the
decision making process. The course covers the fundamental quantitative techniques applied for
making better decisions.
Learning Outcomes
After finishing the course, students will have a good grasp of the scientific methods to solve managerial
problems. The effort made through the course will teach students how to utilize mathematics in solving
managerial problems. Also, students will learn critical thinking and testing quantitative situations using
available tools. Finally, students will be able to utilize Excel as a tool (through Solver) in solving
formulations and providing the base for sensitivity analysis.
Teaching Methods
The course will be based on the following teaching and learning activities:



Power point presentations that covers the theoretical part
Review questions
Lab sessions
Course Plan
Course Time Table:
Week
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
Subjects
Operation research models.
Queuing and simulation models.
Phases of an OR study.
Two-variable Lp model.
Graphical solution.
Computer solution of LP problems. (First Exam)
LP solution space in equation form.
Transition from graphical to algebraic solution.
Artificial starting solution.
Definition of the transportation model.
The transition algorithm. (Second exam)
The assignment model.
Network definitions.
Minimal spanning tree.
Integer programming algorithms.
Final Exam
Evaluation Plan
Modes Of Assessment
First Exam
Second Exam
Assignments
Final Exam
Score
20%
20%
10%
50%
* Makeup exams will be offered for valid reasons only. Makeup exams may be different from regular exams in content and
format.
Attendance Policy
Lecture attendance is mandatory. Students are allowed maximally of 15% absentia of the total module
hours.
Teaching Resources
Main Textbook : Hamdy A. Taha, Operation Research An Introduction, , 76th edition,
Prentice Hall.
Recommended Books:
Anderson, D.R., Sweeney, D. J. and Williams, T.A (2000). An Introduction to Management
Science: Quantitative Approaches to Decision Making (9th edn.), Cincinnati, Southwestern
College Publishing.
Turban, E. and Meredith, J. (1994). Fundamentals of Management Science (6th edn.), IRWIN,
Burr Ridge, Illinois.
Taylor, W.B. (2004). Introduction to Management Science (8th edn), New Jersey: Prentice
Hall.
Winston, L.W. (1991). Operation Research: Application and Algorithms (2nd edn), Boston:
PWS-Kent Publishing.