Welcome,
Guest
.
Login
.
Türkçe
NİNOVA
COURSES
HELP
ABOUT
Where Am I:
Ninova
/
Courses
/
Institute of Science and Technology
/
END 508
/
Course Informations
Return to Faculty
Home Page
Course Information
Course Weekly Lecture Plan
Course Evaluation Criteria
Course Information
Course Name
Turkish
Matematiksel Programlama
English
Mathematical Programming
Course Code
END 508
Credit
Lecture
(hour/week)
Recitation
(hour/week)
Laboratory
(hour/week)
Semester

3
3


Course Language
Turkish
Course Coordinator
Özgür Kabak
Course Objectives
1. In depth analysis of linear programming theory
2. Recognition of modeling in linear programming
Course Description
The course consists of theoretical analysis and modeling of linear programming methods. For this purpose; it includes the following topics: convex analysis, theory of simplex method, resolution of the degeneracy problem, revised simplex method, duality theory and sensitivity analysis, interior point methods, decomposition principle, modeling with GAMS, and modeling applications.
Course Outcomes
1. In depth analysis of simplex method
2. Learning resolution of the degeneracy problem
3. Recognition of duality theory and sensitivity analysis
4. Introduction to interior point methods
5. Recognition of modeling in linear programming
6. Modeling with GAMS
Prerequisite(s)
Required Facilities
Other
Textbook
M.S. Bazaraa, J.J. Jarvis, Linear Programming and Network Flows, John Wiley and Sons Inc., 1977
Other References
G.B. Dantzig, M.N. Thapa, (1997) Linear Programming: 2: Theory and Extensions, Springer
G.Hadley (1968) Linear Programming, AddisonWesley Publishing company, 1968
D. Bertsimas and J.N. Tsitsiklis (1997) Introduction to Linear Optimization, Athena Scientific
Courses
.
Help
.
About
Ninova is an ITU Office of Information Technologies Product. © 2024