‫جمهورية العراق‬
‫وزارة التعليم العالي والبحث العلمي‬
‫جامعة بابل‬
‫كلية العلوم للبنات‬
‫قسم علوم الحاسوب‬
‫الدراسات االولية‬
‫رقم المقرر الدولي‬
‫‪Course NO:‬‬
‫وثق ما تفعل‬
‫وافعل ما توثق‬
‫ادارة الجودة الشاملة‬
‫‪Curriculum and Process Design Evidence‬‬
‫)‪CAPDE(7-3-1.2.3.-02-01‬‬
‫دليل تصاميم المناهج والمقررات‬
‫العدد ‪-:‬‬
‫استماره خاصة الطالع الطلبة على المقرر‬
‫التاربخ‪-:‬‬
‫رقم االصدار ‪ .......................................‬تاريخ االصدار‪......................... ..‬‬
‫‪-1‬اسم المقرر بحوث العمليات‬
‫إجباري ‪.................‬اختياري‪............*.............‬‬
‫‪-2‬عدد الوحدات‪......6 .......‬عدد الساعات اإلجمالي‪.. ..120. .‬النظري‪ 60 .....‬العملي‪...........60 ...‬‬
‫‪-3‬المرحلة الدراسية الثالثة‬
‫‪-4‬اسم التدريسي او التدريسيين‬
‫‪ -1‬سعد عبد ماضي‬
‫الشهادة واللقب العلمي‬
‫‪ -1‬دكتوراه ‪ -‬أستاذ‬
‫برنامج المقرر‬
‫ المقدمة‬-:‫أوال‬
Operations research (OR) is concerned with optimal decision making in , and
modeling of , deterministic and probabilistic system that originate from real
life . It is useful to structure the real life situation into a mathematical model,
abstracting the essential element so that a solution relevant to the decision
maker's objective can be sought. Developing a solution , including the
mathematical theory that yields on optimal value of the system measure of
desirability . This course will cover topic that include: linear programming ,
Transportation , Assignment , Network analysis, game theory and CPM
technique.
:‫ أهداف المقرر‬:‫ثانيا‬
The course aims to introduce the computer science students and other interested in
operations research to use quantitative methods and techniques for effective decision
makings with emphasis on those problems require resource allocations. The learning
will emphasize model-formulation skills. The algorithmic, with simple mathematical
tools, approach rather than in-depth theory study is presented.
‫مفردات المقرر أو المحتوى‬:‫ثالثا‬
week
Date
Topics Covered
Introduction and overview of
OR
Linear programming :
Introduction and Formulation
Linear programming: Graphic
solution
Linear programming: Special
cases in graphical solution
Linear programming:
introduction to simplex
method and computational
procedure for simplex method.
Linear programming:
Artificial variable Technique:
two– phase method.
Linear programming:
artificial variable technique:
Big-M method
Linear programming: Special
cases in simplex method
1
lecture 1
23/9/2012
2
lecture 2
30/9/2012
3
lecture 3
7/10/2012
4
lecture 4
14/10/2012
5
lecture 5
21/10/2012
6
lecture 6
28/10/2012
7
lecture 7
4/11/2012
8
lecture 8
11/11/2012
Lab.
Experiment
Assignments
HW1
HW2
HW3
Notes
9
lecture 9
10
11
Exam1
Lecture10
12
lecture 11
13
lecture 12
14
lecture 13
15
lecture 14
16
Lecture15
17
lecture 16
18
lecture 17
19
20
21
22
Exam2
Spring
Break
lecture 18
23
lecture 19
24
lecture 20
25
lecture 21
26
27
Exam3
lecture 22
28
lecture 23
18/11/2012 Linear programming: the
revised simplex method
25/11/2012
2/12/2012 Linear programming: Duality
in LPP.
9/12/2012 Linear programming:
computational procedure of
dual simplex method
16/12/2012 Linear programming :
sensitivity analysis
23/12/2012 Linear programming:
sensitivity analysis
30/12/2012 Transportation model:
introduction and
mathematical formulation
6/1/2013 Transportation Model:
methods for initial basic
feasible solution (North – West
corner rule and matrix
minimum method )
13/1/2013 Transportation method:
method for initial basic
feasible solution Vogal’s
Approximation method.
20/1/2013 Transportation method:
examining the IBFS for
optimality (using modified
distribution method)
27/1/2013
HW4
HW5
HW6
HW7
HW8
3/2/2013 – 16/2/2013
17/2/2013 Assignment problem:
introduction and
Hungarian method
24/2/2013 Assignment problem:
unbalanced and maximal
assignment problems
3/3/2013 Game theory :introduction
and solving two- Pearson
and Zero-sum game
10/3/2013 Game theory: Game with
mixed strategies (analytic
and graphic methods)
17/3/2013
24/3/2013 Game theory: simplex
method
31/3/2013 Network models: shortest
route problem
HW9
HW10
HW11
29
lecture 24
7/4/2013
30
lecture 25
14/4/2013
31
lecture 26
21/4/2013
32
lecture 27
28/4/2013
33
lecture 28
5/5/2013
34
35
lecture 29
lecture 30
12/5/2013
19/5/2013
Network models: minim
ax spanning tree problem
Network models: maximal
flow problem
CPM /PERT:
introduction and network
diagram
CPM /PERT: critical path
in network analysis
CPM /PERT: project
evaluation
Exam 4
Review
HW12
HW13
‫ طريقة التدريس المعتمدة لتنفيذ المقرر‬: ‫رابعا‬
.‫ استخدام المحاضرة مع شاشة العرض والسبورة ان اقتضت الضرورة‬.1
.‫ تحفيز الطلبة للمشاركة والمناقشة في المحاضرة‬.2
.‫ تكليف الطلبة بواجبات بيتيه يتم تقيمها ومن ثم مناقشتها في ساعات مناقشة خاصة لهذا الغرض‬.3
‫توزع درجات المقرر‬:‫خامسا‬
Course
Assessment
General Notes
Exams.
(3)*(10)
Home
works
(30%)
(5%)
Study system: yearly
Participatio
n and
Quizzes
(5%)
Final
Total
60%
(100%)
)text book (‫كتاب منهجي‬:‫سادسا‬
Hamdy , A T(2007):operations research: an introduction
) references(‫ المراجع‬:‫سابعا‬
1. Hiller , F.S. and Lieberman , G.S.(2005):Introduction to operations research .8th
edition . McGraw – Hill.
2. Winston, W.L(2004): operation research 4th edition Duxbury press
‫رئيس القسم وتوقيعه‬
‫ محمد عبد هللا ناصر‬.‫د‬
‫مدرس المادة وتوقيعه‬
‫سعد عبد ماضي‬:‫األستاذ الدكتور‬