COURSE INTRODUCTION AND APPLICATION INFORMATION
Pre-requisites
:
IST327 Operation Research I - Linear Algebra
Code
Course Name
2
Application
(hour/week)
IST 327
Operation Research II
Course Language
:
Course
Type(CompulsoryElective)
:
Course Level
:
Course Coordinator
Course Lecturers
Course Assistants
Semester
Lesson
(hour/week)
6
Laboratory
(hour/week)
2
ECTS
Credit
6
English
Compulsory
Undergraduate
:
Refail Kasımbeyli
:
:
:
Refail Kasımbeyli
Emine Akyol
This course is the second part of a two-term sequence (IST327-IST328), aims to give
students a good foundation in the mathematics of Operations Research and
introductory knowledge in modeling and solving the network, integer and nonlinear
optimization problems arisen in such diverse areas as manufacturing, transportation,
construction, telecommunications, financial planning, health care, the military, public
services etc.
Upon successful completion of this course, the student
- will be able to construct mathematical model of the problem related to the
area of interest,
- will be able to use solution methods for solving the network optimization
problems,
- will be able to use the special solution methods for solving the integer
programming problems,
- will be able to analyze general nonlinear programming problems,
- will be able to use some solution methods for solving the nonlinear
programming problems,
- will be able to implement Excel and GAMS (the general algebraic modeling system)
software to solve mathematical models.
- will be able to provide positive and understandable conclusions to the
decision maker.
Course Objective
:
Course Learning
Outcomes
:
Course Content
(Short definition)
The main subjects of the course are the construction and analysis of the mathematical
models of transportation, assignment, network and integer optimization problems and
special solution method.
WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES
Week
Subjects
1
2
3
4
The Transportation Problem. Modeling techniques.
Solving the transportation problems using Excel.
Introduction to The Transportation Simplex Method.
Finding an initial basic feasible solution. Writing GAMS
codes for solving transportation problems and LP
models.
The Transportation Simplex Method. The optimality
test and finding of an entering and leaving basic
variables.
5
The Assignment Problem and a Special Algorithm for
the Assignment Problem.
6
Network Optimization Models. The Shortest-Path
Problem.
7
The Minimum Spanning Tree Problem. The Maximum
Flow Problem.
8
The Minimum Cost Flow Problem. LP models for
Network optimization problems and GAMS codes.
9
10
Integer Programming. Prototype example.
Model Formulation Examples with Binary Variables.
Related Preparation
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 8
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 8
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 8
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 8
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 8
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 9
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 9
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 9
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 11
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 11
11
Model Formulation Examples with Binary Variables.
The Branch-and-Bound Technique.
12
13
14
A Branch-and-Bound Algorithm for Mixed Integer
Programming. The branch and cut approach to solving
binary integer programming problems.
Nonlinear programming. One-variable Unconstrained
Optimization. The Bisection Method and Newton’s
Method. Multivariable Unconstrained Optimization. The
Gradient Search Procedure.
Convex Programming. The Karush-Kuhn-Tucker
conditions for constrained optimization. Frank-Wolfe
Algorithm.
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 11
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 11
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 11
Introduction to Operations
Research, Frederick S.
Hillier, Gerald J.
Lieberman, Ninth Edition,
2010 Mc Graw-Hill,
Chapter / Kısım 11
SOURCES
Course Notes
:
Other Sources
:
Introduction to Operations Research, Frederick S. Hillier, Gerald J. Lieberman,
Ninth Edition, 2010 Mc Graw-Hill, ISBN: 978-007-126767-0.

Operations Research. An Introduction, Hamdy A. Taha, Sixth Edition, 1997,
Prentice-Hall, ISBN 0-13-281172-3.

Operations Research: Applications and Algorithms, Wayne L. Winston,
Duxbury Press, ISBN 0-534-20971-8.
EVALUATION SYSTEM
SEMESTER REQUIREMENTS
Attendance - Participation
Lab
Application
Field Work
Special Course Internship
Quizzes
Homework Assignments
Presentations
Project
Seminar
Mid-Terms
Final
TOPLAM/TOTAL
PERCENTAGE OF SEMESTER WORK
PERCENTAGE OF FİNAL EXAM
TOPLAM/TOTAL
SAYISI/
NUMBER
KATKI PAYI/
PERCENTAGE
OF GRADE
3
5
15
10
2
1
35
40
100
60
40
100
COURSE CATEGORY
Course Category
(Only one category will be chosen)
Core Courses
Major area courses
Supportive Courses
Media and management skills courses
Transferable skill courses
x