Develop a broad perspective on the relationships between various types of optimization problems; acquire modeling and solution skills for various methodologies: integer programming, network flows, dynamic programming, heuristics; apply these skills to problems from domains such as service, production, transportation, and energy systems.
Operations Research II (IE 312)
2021 Spring
Faculty of Engineering and Natural Sciences
Industrial Engineering(IE)
3
6.00 / 6.00 ECTS (for students admitted in the 2013-14 Academic Year or following years)
Tonguç Ünlüyurt tonguc@sabanciuniv.edu,
Click here to view.
English
Undergraduate
IE301 IE311
Formal lecture,Interactive lecture,Recitation
Interactive
Click
here
to view.
| Programs\Type | Required | Core Elective | Area Elective |
| BA- Political Science | |||
| BA-Cultural Studies | |||
| BA-Cultural Studies | |||
| BA-Economics | |||
| BA-Economics | |||
| BA-International Studies | |||
| BA-International Studies | |||
| BA-Management | |||
| BA-Management | |||
| BA-Political Sci.&Inter.Relat. | |||
| BA-Political Sci.&Inter.Relat. | |||
| BA-Social & Political Sciences | |||
| BA-Visual Arts&Visual Com.Des. | |||
| BA-Visual Arts&Visual Com.Des. | |||
| BS-Biological Sci.&Bioeng. | |||
| BS-Computer Science & Eng. | |||
| BS-Computer Science & Eng. | |||
| BS-Electronics Engineering | |||
| BS-Electronics Engineering | |||
| BS-Industrial Engineering | * | ||
| BS-Manufacturing Systems Eng. | * | ||
| BS-Materials Sci. & Nano Eng. | |||
| BS-Materials Science & Eng. | |||
| BS-Mechatronics | |||
| BS-Mechatronics | |||
| BS-Microelectronics | |||
| BS-Molecular Bio.Gen.&Bioeng | |||
| BS-Telecommunications | * |
CONTENT
OBJECTIVE
To teach basic ingredients of deterministic optimization including integer programming modeling and solution methods, network models, dynamic programming and heuristics
LEARNING OUTCOME
Have a basic understanding of integer programming modeling and branch and bound algorithm as a solution method.
Have an understanding of basic concepts related to networks, network models including shortest path, maximum flow and minimum cost network flow problems
Have an understanding of dynamic programming
Have an understanding of heuristic approaches
Be able to implement developed models and/or solution methods using appropriate software
Update Date:
ASSESSMENT METHODS and CRITERIA
| Percentage (%) | |
| Final | 40 |
| Midterm | 50 |
| Exam | 10 |
RECOMENDED or REQUIRED READINGS
| Textbook |
Operations Research, Applications and Algorithms |