An Najah National University
Faculty of Engineering & Information Technology
Department of Management Information Systems
Course title and
number
Instructor(s) name(s)
Contact information
Semester and academic
year
Compulsory / Elective
Office hours
Course Objectives
Intended learning
Outcomes
Course Description
Course
Contents
Operations Research and Applications 10676213
Mr. Maher Abu Baker
( abubaker@najah.edu , I.T Building, MIS Department )
Fall 2015/2016
Compulsory
This module aims to introduce students to use quantitative methods
and techniques for effective decisions–making; model formulation
and applications that are used in solving business decision problems.
At the end of this course students expected to :
 Knowledge and understanding
Be able to understand the characteristics of different types of
decision-making environments and the appropriate decision
making approaches and tools to be used in each type.
 Cognitive skills (thinking and analysis)
Be able to build and solve Transportation Models and
Assignment Models.
 Communication skills (personal and academic).
Be able to design new simple models, like: CPM, MSPT to
improve decision –making and develop critical thinking and
objective analysis of decision problems.
 Practical and subject specific skills (Transferable Skills).
Be able to implement practical cases, by using Lindo and
WinQSB
Operations research helps in solving problems in different
environments that needs decisions. The module cover topics that
include: linear programming, Transportation, Assignment, and
CPM/MSPT techniques. Analytic techniques and computer packages
will be used to solve problems facing business managers in decision
environments.
This course introduces Operations Research principles and practices
in decision making. The course focuses on mathematical
programming techniques and its applications such as:
1. Introduction to Operations Research (OR)
2. Modeling with Linear Programming (LP)
2.1. Two-Variable LP Model
2.2. Graphical LP Solution ( Maximization and Minimization
Models )
2.3. Computer Solution with Excel Solver.
1
3.
4.
5.
6.
2.4. Linear Programming Applications
2.4.1. Investment
2.4.2. Production Planning and Inventory Control
2.4.3. Manpower Planning
2.4.4. Urban Development Planning
2.4.5. Blending and Refining
2.4.6. Additional LP Applications.
The Simplex Method and Sensitivity Analysis.
3.1. LP Model in Equation Form
3.2. Simplex Method with maximization and less than or equal
(<=) constraints problems.
3.3. Simplex Method with minimization and equal/greater than or
equal (>=) constraints problems ( Big-M Method ).
3.4. Computer Solution with Lindo and WinQSB Software
Packages.
3.5. Special Cases in Simplex Method
3.5.1. Degeneracy
3.5.2. Alternative Optima
3.5.3. Unbounded Solution
3.5.4. Infeasible Solution
3.6. Sensitivity Analysis
3.6.1. Algebraic Sensitivity Analysis- Changes in the Righthand side (RHS).
3.6.2. Algebraic Sensitivity Analysis- Objective Function.
3.6.3. Sensitivity Analysis with Lindo and WinQSB
Software Packages.
Duality
4.1. Definition of the Dual Problem
4.2. Primal-Dual Relationships.
Transportation Model
5.1. Definition of the Transportation Model
5.2. The Transportation Algorithm
5.2.1. Determination of the Starting Solution
5.2.1.1.
Northwest-corner method
5.2.1.2.
Least-cost method
5.2.1.3.
Vogel approximation method (VAM)
5.2.2. Iterative Computations of the Transportation
Algorithm
5.2.2.1.
Optimal Solution: Modified Distribution
(MODI) Method.
5.3. Assignment Model
5.3.1. The Hungarian Method
5.4. Transportation and Assignment problems with WinQSB
Software Package.
Network Models
6.1. Scope and Definition of Network Models
6.2. Minimal Spanning Tree Algorithm
6.3. Shortest-Route Problem
6.3.1. Examples of the Shortest-Route Applications
6.3.2. Shortest-Route Algorithms
2
Textbook and
References
(Online Resources)
6.3.2.1.
Dijkestra's algorithm
6.3.2.2.
Tabular Method
6.4. Maximal Flow Model
6.4.1. Maximal Flow Algorithm
6.5. Network Model with WinQSB Software Package
Text Book :
Operations Research An Introduction, 9th Edition , Hamdy
A. Taha
Publisher :Prentice Hall is an imprint of Pearson.
ISBN 10: 0-13-139199-2
ISBN 13:978-0-13-139199-4
www.pearsonhighered.com /international
References:

Operations Research Application and Algorithms
by Waynel. Winston

Introduction to Operations Research , by F.S.Hillier
and G.J.Lieberman, 7th Edition, McGraw-Hill,
2000.
See: moodle.najah.edu
Assessment Criteria
Activity
First hour Exam
Second Hour Exam
Quizzes and Assignments
Real Case-Study
Final Exam
COURSE ACTIVITIES Course Duration : 16 weeks , 48 hours in total.
Percent (%)
18
18
12
12
40
The course involves lectures, quizzes, assignments, real case-study, two
midterm exams, and final exam.
Lectures: 38 hours (3 hours per week) include quizzes and exams
Computer Lab work: 10 hours ( 1 hour per week )
Software Required:
Two following software packages will be used : MS EXCEL and Solver,
WinQSB, Modeling with Lindo . All students are expected to be familiar
with the use of spreadsheets.
Class Participation
You are expected to attend classes and participate actively in discussions.
There will be a subjective evaluation of your contribution in class. The
3
quality of your contribution is more important than the quantity. Class
attendance will be monitored and will be factored into the class
participation points.
Course Academic Calendar
Week
Material to be covered
Introduction to Operations Research (OR),Operations
1
Research definition and origin. Essential features of the
OR approach. Phases of an OR study
Linear Programming (LP), LP and allocation of
2
resources, LP definition, Linearity requirement, twovariable LP model
Graphical LP Solution ( Maximization and
3
Minimization Models ),Computer Solution with Excel
Solver.
Linear Programming Applications such as investment,
4
production planning and inventory control, manpower
planning, urban development planning, blending and
refining and additional LP applications.
The Simplex Method and LP model in equation form
5
Simplex Method with maximization and less than or
6
equal (<=) constraints problems.
7
8
9
10
11
12
13
14
Simplex Method with minimization and equal/greater
than or equal (>=) constraints problems ( Big-M Method
). Computer Solution with Lindo and WinQSB Software
Packages.
Special Cases in simplex method: Degeneracy,
Alternative Optima, Unbounded Solution and Infeasible
Solution
Sensitivity Analysis: Algebraic Sensitivity AnalysisChanges in the Right-hand side (RHS).
Algebraic Sensitivity Analysis- Objective Function.
Sensitivity Analysis with Lindo and WinQSB Software
Packages.
Duality :Definition of the Dual Problem and PrimalDual Relationships.
Transportation Model : definition of the transportation
model, the transportation algorithm , determination of
the starting solution: northwest-corner method, leastcost method and Vogel approximation method (VAM) .
The use of Slover and WinQSB
Iterative Computations of the Transportation Algorithm
Optimal Solution: Modified Distribution (MODI)
Method.
Assignment Model: the Hungarian method and
Activities
Assignment 1
Assignment 2
HW1
First Exam
Assignment 3
HW3
Assignment 4
Second Exam
Assignment 5
Assignment 6
4
15
16
Transportation and Assignment problems with WinQSB
Software Package.
Network Models: Scope and definition of network
models
Minimal Spanning Tree Algorithm, Shortest-Route
Problem
Examples of the Shortest-Route Applications, ShortestRoute Algorithms : Dijkestra's algorithm and Tabular
Method
Maximal Flow Model: Maximal Flow Algorithm and
network model with WinQSB Software Package
Assignment 7
Final Exam
5