Skip to main content
Cyprus International University
TR

OPERATIONS RESEARCH I

Course
INDE321 - OPERATIONS RESEARCH I
Department
Engineering Management - English - Master
Course Type
Scientific Preparation
Status
Required
Language
English
Credit
0
ECTS
0
T+P+L
3 + 0 + 2
Course Coordinator(s)
Dr. Behzad SANAEI
Prerequisite
-
Keywords
-

Course Description

OPERATIONS RESEARCH I

OPERATIONS RESEARCH I

Evaluation Tools (Active Term)

Item Type Weight (%)
Midterm Exam Midterm 35
Final Exam Final 40
Quiz 01 Quiz 7
Quiz 02 Quiz 8
Lab work 01 Assignment 5
Labwork 02 Assignment 5
Total 100

Course outcomes

  1. 01 Formulate a real-world problem as a mathematical programming model. Implement and solve the model in EXCEL and LINDO.
  2. 02 Understand the theoretical workings of the simplex method for linear programming and perform iterations of it by hand
  3. 03 Perform sensitivity analysis to determine the direction and magnitude of change of a model’s optimal solution as the data change.
  4. 04 Solve specialized linear programming problems like the transportation and assignment problems.Solve network models like the shortest path, minimum spanning tree, and maximum flow problems.
  5. 05 nderstand the applications of, basic methods for, and challenges in integer programming

Course Syllabus

Week Topic
Week 1 Course Orientation and OR Applications
Week 2 LP Modeling and Graphical Solution
Week 3 LP Standard Form and Simplex Basics
Week 4 Simplex Solution and Interpretation
Week 5 Big-M and Two-Phase Methods
Week 6 Big-M and Two-Phase Methods
Week 7 Sensitivity Analysis
Week 8 MIDTERM WEEK
Week 9 MIDTERM WEEK
Week 10 Duality
Week 11 Transportation Models
Week 12 Assignment Models
Week 13 Network Models: Shortest Path and Maximum Flow
Week 14 Integer and Binary Programming
Week 15 Integrated Applications

Reference Books & Course Materials

  1. 01 Wayne L. Winston, Operations Research: Applications and Algorithms, 4th ed., Duxbury Press, 2004. ISBN: 0-534-42362-0
  2. 02 Taha, Hamdy A., Operations Research, 6th ed., Prentice Hall, 1997.
  3. 03 Hillier, F.S. and Lieberman, G.J., Introduction to Operations Research, 7th ed., McGraw Hill, 2001

Learning Outcomes

  1. L01 Formulate a real-world problem as a mathematical programming model. Implement and solve the model in EXCEL and LINDO.
  2. L02 Understand the theoretical workings of the simplex method for linear programming and perform iterations of it by hand
  3. L03 Perform sensitivity analysis to determine the direction and magnitude of change of a model’s optimal solution as the data change.
  4. L04 Solve specialized linear programming problems like the transportation and assignment problems.Solve network models like the shortest path, minimum spanning tree, and maximum flow problems.
  5. L05 nderstand the applications of, basic methods for, and challenges in integer programming

Program Outcomes

No program outcomes have been defined.

Po-Lo Matrix

The PO-LO matrix has not been populated yet.