# قارعلا ةيروهمج يملعلا ثحبلاو يلاعلا ميلعتلا ةرازو

ةلماشلا ةدوجلا ةرادا

قارعلا ةيروهمج

يملعلا ثحبلاو يلاعلا ميلعتلا ةرازو

لعف ت ام قثو لباب ةعماج

قثوت ام لعفاو تانبلل مولعلا ةيلك

بوساحلا مولع مسق

ةيلولاا تاسارد لا

Curriculum and Process Design Evidence

CAPDE(7-3-1.2.3.-02-01)

تاررقملاو جهانملا ميماصت ل يلد : ددعلا يلودلا ررقملا مقر

:خبراتلا ررقملا ىلع ةبل طلا علاطلا ةصاخ هرامتسا Course NO:

.........................

..رادصلاا خيرات ....................................... رادصلاا مقر

# تايلمعلا ثوحب

ررقملا مسا 1

............

* .............يرايتخا.................

يرابجإ

...........

30 ...يلمعلا 90 .....يرظنلا..

..

120 . .

يلامجلإا تاعاسلا ددع......

3 .......تادحولا ددع 2

ةثلاثلا ةيساردلا ةلحرملا 3

نييسيردتلا وا يسيردتلا مسا 4

يضام دبع دعس 1

ذاتسأ هاروتكد 1

يملعلا بقللاو ةداهشلا

1

2

3

4

5

6

7

8

ررقملا جمانرب

ةمدقملا : لاوأ

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 lecture 1 lecture 2 lecture 3 lecture 4 lecture 5 lecture 6 lecture 7 lecture 8

Date Topics Covered

16/9/2013 Introduction and overview of

OR

23/9/2013 Linear programming :

Introduction and Formulation

30/9/2013 Linear programming: Graphic solution

7/10/2013 Linear programming: Special cases in graphical solution

14/10/2013

21/10/2013

28/10/2013

4/11/2013

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

Lab.

Experiment

Assignments

HW1

HW2

Notes

9

10 lecture 9 lecture 10

11 Exam1

12 Lecture11

13 lecture 12

11/11/2013

18/11/2013

25/11/2013

2/12/2013

9/12/2013

Linear programming: Special cases in simplex method

Linear programming: the revised simplex method

Linear programming: Duality in LPP.

Linear programming: computational procedure of dual simplex method

14

15

16

18

19

20 Spring

21 lecture 13 lecture 14 lecture 15

17 Lecture16 lecture 17

Exam2

Break

22 lecture 18

16/12/2013

23/12/2013

30/12/2013

6/1/2014

Linear programming : sensitivity analysis

Linear programming: sensitivity analysis

Transportation model: introduction and mathematical formulation

Transportation Model: methods for initial basic feasible solution (North – West corner rule and matrix minimum method )

13/1/2014 Transportation method: method for initial basic feasible solution Vogal’s

Approximation method.

20/1/2014

26/1/2014 – 6/2/2014

10/2/2014

23

24

25

26

27

28 lecture 19 lecture 20 lecture 21 lecture 22 lecture 23

Exam3

17/2/2014

24/2/2014

1/3/2014

8/3/2014

15/3/2014

22/3/2014

Transportation method: examining the IBFS for optimality (using modified distribution method)

Assignment problem: introduction and

Hungarian method

Assignment problem: unbalanced problem

Assignment problem: maximal assignment problem

Game theory :introduction and solving two- Pearson and Zero-sum game

Game theory: Game with mixed strategies (analytic and graphic methods)

HW3

HW4

HW5

HW6

HW7

HW8

HW9

HW10

19

29

30

31

32

33

34

35 lecture 23 lecture 24 lecture 25 lecture 26 lecture 27 lecture 28 lecture 29

29/3/2014

5/4/2014

12/4/2014

19/4/2014

26/4/2014

3/5/2014

10/5/2014

Game theory: simplex method

Network models: shortest route problem

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

HW11

HW12

HW13

36 lecture 30 17/5/2014 Exam 4

37 lecture 31 24/5/2014 Review

.

ةرورضلا تضتقا نا ةروبسلاو

ررقملا ذيفنتل ةدمتعملا سيردتلا ةقيرط : اعبار

ضرعلا ةشاش عم ةرضاحملا مادختسا

.ةرضاحملا يف ةشقانملاو ةكراشملل ةبلطلا زيفحت

.ضرغلا اذهل ةصاخ ةشقانم تاعاس يف اهتشقانم مث نمو اهميقت متي هيتيب تابجاوب ةبلطلا فيلكت

.

1

.

2

.

3

ررقملا تاجرد ع زوت :اسماخ

Course

Assessment

Exams.

(3)*(10)

Home works

Participatio n and

Quizzes

(5%)

Final Total

General Notes

(30%) (5%)

Study system: yearly

60% (100%)

Hamdy , A T(2007):operations research: an introd

) text book uction

( يجهنم باتك :اسداس

) references ( عجارملا :اعباس

1.

Hiller , F.S. and Lieberman , G.S.(2005):Introduction to operations research .8

th edition . McGraw – Hill.

2.

Winston, W.L(2004): operation research 4 th edition Duxbury press

3.

توريب ةعابطلل ,سربوميد ةسسؤم . اقيبطتو اموهفم :تايلمعلا ثوحب :) 2009 ( يترمشلا دعس دماح

هعيقوتو مسقلا سيئر

رصان الله دبع دمحم .د

هعيقوتو ةداملا سردم

يضام دبع دعس:روتكدلا ذاتسلأا