Syllabus Application
IE 311
Operations Research I
Faculty
Faculty of Engineering and Natural Sciences
Semester
Summer 2025-2026
Course
IE 311 -
Operations Research I
Time/Place
Time
Week Day
Place
Date
13:40-16:30
Mon
FENS-L055
Jul 6-Aug 21, 2026
14:40-17:30
Tue
FENS-L055
Jul 6-Aug 21, 2026
Level of course
Undergraduate
Course Credits
SU Credit:3, ECTS:6, Basic:2, Engineering:4
Prerequisites
( MATH 201 or MATH 212) and ENS 208
Corequisites
IE 311R
Course Type
Lecture
Instructor(s) Information
Erhun Kundakcıoğlu
Course Information
Catalog Course Description
Linear and integer programming formulations; convex analysis; algorithmic design and the simplex method; duality and sensitivity; computer implementations.
Learning Outcomes:
| 1. | Model decision problems into integer or continuous linear programming models. |
|---|---|
| 2. | Apply primal and dual simplex methods to solve linear programming problems |
| 3. | Have a basic knowledge of the concept of duality in linear programming and its consequences. |
| 4. | Interpret solutions using simplex optimality conditions, and perform sensitivity and reoptimization analyses. |
| 5. | Implement linear and integer programming formulations in a programming language. |
Course Objective
The objective of this course is to study the modeling and solution of decision problems with deterministic parameters using operations research techniques with a particular emphasis on solution algorithms and implementation.
-
Course Materials
Resources:
Operations Research: Applications and Algorithms, 4th edition. W.L. Winston. Thomson/Brooks/Cole, 2004.
Technology Requirements:
Students will need to model, implement and solve linear and integer programs in lectures and recitations. We will use Gurobi solver with Python interface.