SDU Education Information System
   Home   |  Login Türkçe  | English   
 
   
 
 


 
Course Information
Course Unit Title : Linear Programming and Network Analysis
Course Unit Code : 01END5101
Type of Course Unit : Optional
Level of Course Unit : Second Cycle
Year of Study : Preb
Semester : 255.Semester
Number of ECTS Credits Allocated : 6,00
Name of Lecturer(s) : ---
Course Assistants :
Learning Outcomes of The Course Unit : 1) To recognize the concept of Operational Research
2) optimization problems as linear modeling can
3) Linear decision models to recognize and grasp the solution
4) Linear decision models to analyze and interpret the solutions
Mode of Delivery : Face-To-Face
Prerequisities and Co-requisities Courses : Unavailable
Recommended Optional Programme Components : Unavailable
Course Contents : Operations Research (OR) 's Definition and Overview, YA'nın Relations with Other Field, the history, YA'nın Applications and Application Examples, Linear Programming (DP) and Properties, DP's Graphics Solution, Various DP Model samples, the DP Model Simplex Solution: Standard Form, Basic Solutions, Simplex Algorithm İlkil, United-M-Method, Two-Phase Method, Dual Simplex Method, Simplex Method in the Special Cases, Binary concept, First-binary Solutions Between the Binary Economic Analysis of Comments -Shadow-Prices Reduced Cost, Sensitivity Analysis, Changes Affecting Eniyiliği, Transport Models, Network Models, Integer Algorithms
Languages of Instruction : Turkish
Course Goals : Operations Research to recognize
as a model of linear optimization problems by solving a variety of ways to gain the ability to interpret
Course Aims : Students taking this course, to introduce operations research, linear optimization problems solved by various methods to interpret the model's ability to win.
WorkPlacement   Not Available
Recommended or Required Reading
Textbook : Lecture Notes
Additional Resources : - Bazaraa, M. S., Jarvis, J. J., Sherali, H. D., Linear Programming and Network Flows, Second Edition, 1990
Material Sharing
Documents :
Assignments :
Exams :
Additional Material :
Planned Learning Activities and Teaching Methods
Lectures, Practical Courses, Presentation, Seminar, Project, Laboratory Applications (if necessary)
ECTS / Table Of Workload (Number of ECTS credits allocated)
Student workload surveys utilized to determine ECTS credits.
Activity :
Number Duration Total  
Course Duration (Excluding Exam Week) :
14 3 42  
Time Of Studying Out Of Class :
14 4 56  
Homeworks :
6 3 18  
Presentation :
0 0 0  
Project :
1 10 10  
Lab Study :
0 0 0  
Field Study :
0 0 0  
Visas :
1 20 20  
Finals :
1 30 30  
Workload Hour (30) :
30  
Total Work Charge / Hour :
176  
Course's ECTS Credit :
6      
Assessment Methods and Criteria
Studies During Halfterm :
Number Co-Effient
Visa :
1 50
Quiz :
0 0
Homework :
0 0
Attendance :
0 0
Application :
0 0
Lab :
0 0
Project :
0 0
Workshop :
0 0
Seminary :
0 0
Field study :
0 0
   
TOTAL :
50
The ratio of the term to success :
50
The ratio of final to success :
50
TOTAL :
100
Weekly Detailed Course Content
Week Topics  
1 Introduction
 
2 Linear Algebra, Convex Analysis and Polyhedral Sets
 
3 Simplex Method
 
4 Starting Solution and Convergence
 
5 Special Simplex Implementations and Optimality Conditions
 
6 Duality and Sensitivity Analysis
 
7 Dualite ve Duyarlılık Analizi
 
8 Decomposition Principle
 
9 Complexity of The Simplex Algorithm and Polynomial Algorithms
 
10 Network Flows
 
11 Network Flows
 
12 Transportation and Assignment Problems
 
13 Transportation and Assignment Problems
 
14 Maximal Flows and Shortest Path Problems