Operations Research I
IE 311

Unpublished Syllabus
This syllabus is not published yet. Only you can view it.
Faculty: Faculty of Engineering and Natural Sciences
Semester: Fall 2025-2026
Course: Operations Research I - IE 311
Classroom: FENS-G032,FMAN-G013
Level of course: Undergraduate
Course Credits: SU Credit:3.000, ECTS:6, Basic:2, Engineering:4
Prerequisites: ( MATH 201) and ( ENS 208)
Corequisites: IE 311R
Course Type: Lecture

Instructor(s) Information

Erhun Kundakçı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.
Course Learning Outcomes:
1. Model linear decision problems into an integer or continuous linear programming model.
2. Solve linear programming problems by means of the primal and dual simplex methods and be able to decide under which conditions one should apply which method.
3. Have a basic knowledge of the concept of duality in linear programming and its consequences.
4. Implement linear and integer programming formulations in a programming language.
Course Objective
-

Course Materials

Resources:
-
Technology Requirements:
-