King Saud University
  Help (new window)
Search


Guidelines_English_Final
تحميل الدليل التدريبي

أسئلة شائعة


 

             OR-101
      Fundamentals
       of Operations 
         Research

 

 

 

(View this page in Arabic)

 Course:

            Section #         : 12997 
            Credit Hours  : 4 Credit hours
            Time                : 11:00 – 11:50am 
            Days               : Saturday , Monday, Wednesday
            Class Room    : AB 18   Bldg  #4  Main Campus
            Prerequisites  : None

             

Instructor:

            Name              : Dr.  Khalid A. Al-Nowibet
            Office              : AB 27    Bldg #4    Main Campus
            Telephone       : 01-467-6334
            E-mail             : knowibet@ksu.edu.sa

 

Course Description:

This course is an introductory course designed for computer science student. The course covers a brief history of operations research and some major models in OR. The main subjects covered in the course are: the graphical solution of linear programs, the algebraic solution of linear programs, transportation problems, assignment problems, shortest path problem, minimal spanning tree, decision making under risk, decision making under uncertainty and the basic queueing model.

 

Text Book and References:

  1. مقدمة في بحوث العمليات ، د. زيد البلخي
  2. Operations Research: An Introduction, HamdyA. Taha.
  3. Introduction to Operations Research, F. S. Hillier and G. J. Lieberman 5th edition.
  4. Operations Research Applications and Algorithms, Wayne L. Winston, 3rd edition.

 

Lectures:

Lectures of the course are thought using Power Point slides (in ِArabic). Slides of the lectures are available in my website. Therefore, every student must have the slides of the subject with hem during the lecture. Also, the subjects are presented in an interactive way so every student is required to participate during the lecture.

 

Attendance:

All students must attend the lectures. Attendance will be taken at the beginning of each lecture. Any student fail to attend 25% of the course will not be allowed to take the final exam according to the university policy.

 

Grading:

The final grade in the course is calculated according to the following distribution:

  • Homework and Tutorial            10%
  • Midterm-I                                20%
  • Midterm-II                               20%
  • Final Exam                               50%

Attendance, participation and quizzes are also counted toward the final grading as a bonus in the course. Each takes about 10 minutes. The quizzes dates will not be announced. Normally, a quiz covers the materials presented in the same day of the quiz.   

 Lecture Notes

Lec27_Decision under risk.pdfLec27_Decision under riskخالد عبدالعزيز ابراهيم النويبت
Lec28_Decision under Uncertainity.pdfLec28_Decision under Uncertainityخالد عبدالعزيز ابراهيم النويبت
Lec29_Decision Tree.pdfLec29_Decision Treeخالد عبدالعزيز ابراهيم النويبت
Lec2_Model Building in OR.pdfLec2_Model Building in ORخالد عبدالعزيز ابراهيم النويبت
Lec30_Queues.pdfLec30_Queuesخالد عبدالعزيز ابراهيم النويبت
Lec3_Model Building Examples.pdfLec3_Model Building Examplesخالد عبدالعزيز ابراهيم النويبت
Lec4_Model Building Examples2.pdfLec4_Model Building Examples2خالد عبدالعزيز ابراهيم النويبت
Lec5_ LP Properties and Graphical  Sol.pdfLec5_ LP Properties and Graphical Solخالد عبدالعزيز ابراهيم النويبت
Lec6_ LP Graphical Sol Example.pdfLec6_ LP Graphical Sol Exampleخالد عبدالعزيز ابراهيم النويبت
Lec7_LP_Special Cases_Graphical.pdfLec7_LP_Special Cases_Graphicalخالد عبدالعزيز ابراهيم النويبت
Lec8_Sensitivity Analysis1.pdfLec8_Sensitivity Analysis1خالد عبدالعزيز ابراهيم النويبت
Lec9_Sensitivity Analysis2.pdfLec9_Sensitivity Analysis2خالد عبدالعزيز ابراهيم النويبت
Shortset Path Example_Handout.pdfShortset Path Example_Handoutخالد عبدالعزيز ابراهيم النويبت
Lec14_Simplex Special Cases.pdfLec14_Simplex Special Casesخالد عبدالعزيز ابراهيم النويبت
Lec15_Transportation Problems.pdfLec15_Transportation Problemsخالد عبدالعزيز ابراهيم النويبت
Lec16_Transportation Simplex.pdfLec16_Transportation Simplexخالد عبدالعزيز ابراهيم النويبت
Lec17_Transportation Simplex3.pdfLec17_Transportation Simplex3خالد عبدالعزيز ابراهيم النويبت
Lec19_Unbalanced Transportation Simplex.pdfLec19_Unbalanced Transportation Simplexخالد عبدالعزيز ابراهيم النويبت
Lec1_Introduction to OR.pdfLec1_Introduction to ORخالد عبدالعزيز ابراهيم النويبت
Lec20_Assignment Problems.pdfLec20_Assignment Problemsخالد عبدالعزيز ابراهيم النويبت
Lec21_Assignment Problems Algorithm.pdfLec21_Assignment Problems Algorithmخالد عبدالعزيز ابراهيم النويبت
Lec22_Assignment Example.pdfLec22_Assignment Exampleخالد عبدالعزيز ابراهيم النويبت
Lec23_Network Problems.pdfLec23_Network Problemsخالد عبدالعزيز ابراهيم النويبت
Lec24_Network Problems_Spanning Tree.pdfLec24_Network Problems_Spanning Treeخالد عبدالعزيز ابراهيم النويبت
Lec25_Network Problems_Shortest Path.pdfLec25_Network Problems_Shortest Pathخالد عبدالعزيز ابراهيم النويبت
Lec26_Decision Theory.pdfLec26_Decision Theoryخالد عبدالعزيز ابراهيم النويبت
Lec0.pdfLec0خالد عبدالعزيز ابراهيم النويبت
Lec10_Sensitivity Analysis3.pdfLec10_Sensitivity Analysis3خالد عبدالعزيز ابراهيم النويبت
Lec11_Algebraic Solution.pdfLec11_Algebraic Solutionخالد عبدالعزيز ابراهيم النويبت
Lec12_Simplex Algorithm1.pdfLec12_Simplex Algorithm1خالد عبدالعزيز ابراهيم النويبت
(More Documents...)

 Sample Exams

Exam1_25A.pdfExam1_25Aخالد عبدالعزيز ابراهيم النويبت
Exam1_Sol_25A.pdfExam1_Sol_25Aخالد عبدالعزيز ابراهيم النويبت
Exam2_26A.pdfExam2_26Aخالد عبدالعزيز ابراهيم النويبت
Exam2_Sol_25A.pdfExam2_Sol_25Aخالد عبدالعزيز ابراهيم النويبت
FinalExam_25A.pdfFinalExam_25Aخالد عبدالعزيز ابراهيم النويبت
FinalExam_Sol_25A.pdfFinalExam_Sol_25Aخالد عبدالعزيز ابراهيم النويبت
King   Saud University. All rights reserved, 2007 | Disclaimer | CiteSeerx