İŞL 301


Course Title Course Code Program Level
NUMERICAL METHODS I İŞL 301 Management Information Systems B.A. / B.Sc.

Course Term
(Course Semester)
Teaching and Learning Methods
Credits
Theory Practice Lab Projects/Field Work Seminars/Workshops Other Total Credits ECTS Credits
05
(Fall)
42 84 126 3 5

Teaching Staff
Language of Instruction Türkçe (Turkish)
Type Of Course Compulsory
Prerequisites -
Recommended Optional Programme Component
Course Objectives Introduction to mathematical programming and examples, construction of linear programming models, the geometrical interpretation of solutions to the linear programming problems and their algebraic groundwork, the simplex method, the use of artificial variables. duality theory, dual simplex method, the transportation problem, the relationship between game theory and linear programming.
Course Content Aim of this course is to give students a good foundation in the theory and applications of linear programming problems, to develop modelling and analysing skills of mathematical models of linear optimization problems.
Learning Outcomes (LO) The students who attended the course and were successful at the end of semester will acquire the followings; 1- will be able to construct mathematical model of the problem, 2- will be able to use simplex algorithm, 3- will be able to find an optimal or best solution for the problem, 4- will be able to perform a sensitivity analysis, 5- will be able to implement Excel and other softwares to solve mathematical models.
Mode of Delivery Face to face
Course Outline
Week Topics
1. Week Introduction to Operational Research
2. Week Constructing mathematical model of the problem
3. Week Graphical solution and the geometrical interpretation of sensitivity analysis
4. Week Implementing Excel and other softwares to solve mathematical models
5. Week Linear programming application of bank and finance
6. Week The Simplex Algorithm
7. Week The Simplex Algorithm
8. Week Midterm exam
9. Week Duality theory and economic interpretation.
10. Week Sensitivity Analysis
11. Week The transportation models
12. Week The assignment models
13. Week Network models, shortest route models
14. Week Maximal flow, minimum spanning tree
Assessment
  Percentage(%)
Mid-term (%) 40
Quizes (%)
Homeworks/Term papers (%)
Practice (%)
Labs (%)
Projects/Field Work (%)
Seminars/Workshops (%)
Final (%) 60
Other (%)
Total(%) 100
Course Book (s) and/or References 1. Taha, H., 2010, Yöneylem Araştırması; 6. Basımdan Çeviri , Literatür Yayıncılık, İstanbul. 2. Winston, W. L., 2003, Operational Research Applications and Algorithms. 3. Hillier, F.S., Lieberman G.J., 2004, Introduction to Operational Research, McGraw-Hill.
Work Placement(s)
The Relationship between Program Qualifications (PQ) and Course Learning Outcomes (LO)

 

 

PQ1

PQ2

PQ3

PQ4

PQ5

PQ6

PQ7

PQ8

PQ9

PQ10

PQ11

PQ12

PQ13

PQ14

LO1

2

5

 

 

 

 

2

 

 

 

 

 

 

 

LO2

 

5

 

 

 

 

2

 

 

 

 

 

 

 

LO3

 

5

 

 

 

 

 

 

 

 

 

 

 

 

LO4

 

5

 

 

 

 

 

 

 

 

 

 

 

 

LO5

 

5

 

 

 

 

2

 

 

 

 

 

2

 

 

* Contribution Level : 1 Very low    2 Low     3 Medium     4 High      5 Very High