1 |
Course Title: |
LINEAR PROGRAMMING |
2 |
Course Code: |
MAT4030 |
3 |
Type of Course: |
Optional |
4 |
Level of Course: |
First Cycle |
5 |
Year of Study: |
4 |
6 |
Semester: |
8 |
7 |
ECTS Credits Allocated: |
6 |
8 |
Theoretical (hour/week): |
3 |
9 |
Practice (hour/week) : |
0 |
10 |
Laboratory (hour/week) : |
0 |
11 |
Prerequisites: |
None |
12 |
Recommended optional programme components: |
None |
13 |
Language: |
Turkish |
14 |
Mode of Delivery: |
Face to face |
15 |
Course Coordinator: |
Dr. Ögr. Üyesi SETENAY DOĞAN |
16 |
Course Lecturers: |
Yrd.Doç.Dr.Nisa Çelik Yrd.Doç.Dr.Emrullah Yalçın Yrd.Doç.Dr.Sezai Hızlıyel |
17 |
Contactinformation of the Course Coordinator: |
setenay@uludag.edu.tr 0224 2941763 U.Ü. Fen Edebiyat Fakültesi Matematik Bölümü Nilüfer BURSA |
18 |
Website: |
|
19 |
Objective of the Course: |
The aim of the course is to introduce the students to the linear programming problem may be defined as the problem maximizing or minimizing a linear function subject to linear constrains. And solved Grafic, Simplex, Transport methods of its problems,
|
20 |
Contribution of the Course to Professional Development |
|
Week |
Theoretical |
Practical |
1 |
A lineer programming definitions, theorems and methods of solution. |
|
2 |
Graphic method of solving a lineer programming problem, solution is possible and the optimem solution |
|
3 |
Graphic method ,the maximum state and solution |
|
4 |
Graphic method, the minimum state and solution |
|
5 |
Convex set and the situation dejenerated |
|
6 |
Simplex Method |
|
7 |
Simplex table and solution |
|
8 |
Production of the simplex method , max. objective function and solution |
|
9 |
Production of the simplex method min.objective function and solution |
|
10 |
Midterm exam and general review |
|
11 |
Unbounded solution and duality |
|
12 |
Transport problems and solution |
|
13 |
Optimality control.Objective function obtaining |
|
14 |
Approximation methods. |
|