Syllabus Application
Linear Programming and Extensions
IE 501
Faculty:
Faculty of Engineering and Natural Sciences
Semester:
Fall 2025-2026
Course:
Linear Programming and Extensions - IE 501
Classroom:
FENS-L030,FENS-L065
Level of course:
Masters
Course Credits:
SU Credit:3.000, ECTS:10
Prerequisites:
-
Corequisites:
-
Course Type:
Lecture
Instructor(s) Information
Ezgi Karabulut Türkseven
Course Information
Catalog Course Description
Theory of linear programming; convexity; simplex and algorithmic aspects; duality and sensitivity; computational issues; decomposition and column generation; introduction to integer and nonlinear programming.
Course Learning Outcomes:
| 1. | to identify, model, and solve linear programming problems |
|---|---|
| 2. | to describe the connection of the structure of linear programming problems to linear algebra and polyhedral theory |
| 3. | to leverage on LO-2 in order to design and implement an efficient solution method for linear programming |
| 4. | to describe the relationship between primal and dual linear programming problems and exploit it in sensitivity analysis |
| 5. | to describe the main difficulties associated with solving large-scale linear programming problems and overcome them by employing decomposition methods |
Course Objective
This course focuses on the theory of linear programming (LP) although we will discuss some practical implementation issues as well. In the first part of the course, we will review LP modeling, convexity, some essential linear algebra, certain aspects of polyhedral theory, and then present the foundations of linear programming. In the second part of the course, we will discuss the simplex method for solving linear programs and its algorithmic aspects, some related computational issues, duality and sensitivity. Finally, we will cover Dantzig-Wolfe decomposition and column generation for solving large-scale linear programs.
Course Materials
Resources:
-
Technology Requirements:
-