Code IE 501
Term 201901
Title Linear Programming and Extensions
Faculty Faculty of Engineering and Natural Sciences
Subject Industrial Engineering(IE)
SU Credit 3
ECTS Credit 10.00
Instructor(s) Amine Gizem Ozbayg?n ozbaygin@sabanciuniv.edu,
Detailed Syllabus
Language of Instruction English
Level of Course Doctoral
Master
Prerequisites
(only for SU students)
--
Mode of Delivery Formal lecture,Interactive lecture
Planned Learning Activities Interactive,Discussion based learning,Project based learning
Content

Theory of linear programming; convexity; simplex and algorithmic aspects; duality and sensitivity; computational issues; decomposition and column generation; introduction to integer and nonlinear programming.

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. If time permits at the end of the semester, we will briefly introduce further decomposition methods that rely on linear programming and interior point algorithms for solving linear programs. Issues related to computer implementations of linear programming algorithms will generally not be discussed in class, but you will be exposed to the computational aspects of linear programming during assignments.

Learning Outcome

to identify, model, and solve linear programming problems
to describe the connection of the structure of linear programming problems to linear algebra and polyhedral theory
to leverage on LO-2 in order to design and implement an efficient solution method for linear programming
to describe the relationship between primal and dual linear programming problems and exploit it in sensitivity analysis
to describe the main difficulties associated with solving large-scale linear programming problems and overcome them by employing decomposition methods

Programme Outcomes