DERS TANITIM Ve UYGULAMA BİLGİLERİ

Lesson 2 (hour/week) ECTS Code Semester Course Name Credit Application (hour/week)

Laboratory IST 327 6 2 6 Operation Research II (hour/week)

COURSE INTRODUCTION AND APPLICATION INFORMATION

Pre-requisites : IST327 Operation Research I - Linear Algebra

Course Language : English Course Type(Compulsory- : Compulsory Elective) Course Level : Undergraduate : Refail Kasımbeyli Course Coordinator Course Lecturers : Refail Kasımbeyli Course Assistants : 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 Course Objective 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, Course Learning - will be able to analyze general nonlinear programming problems, Outcomes - 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 Content The main subjects of the course are the construction and analysis of the mathematical (Short definition) models of transportation, assignment, network and integer optimization problems and special solution method. WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES

Week Subjects Related Preparation Introduction to Operations Research, Frederick S. Hillier, Gerald J. The Transportation Problem. Modeling techniques. Lieberman, Ninth 1 Solving the transportation problems using Excel. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 8

Introduction to Operations Research, Frederick S. Hillier, Gerald J. 2 Lieberman, Ninth Introduction to The Transportation Simplex Method. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 8 Introduction to Operations Research, Frederick S. Hillier, Gerald J. Finding an initial basic feasible solution. Writing GAMS 3 Lieberman, Ninth codes for solving transportation problems and LP Edition, 2010 Mc models. Graw-Hill, Chapter / Kısım 8 Introduction to Operations Research, Frederick The Transportation Simplex Method. The optimality S. Hillier, Gerald J. 4 test and finding of an entering and leaving basic Lieberman, Ninth variables. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 8 Introduction to Operations Research, Frederick S. Hillier, Gerald J. 5 The Assignment Problem and a Special Algorithm for Lieberman, Ninth the Assignment Problem. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 8 Introduction to Operations Research, Frederick S. Hillier, Gerald J. 6 Network Optimization Models. The Shortest-Path Lieberman, Ninth Problem. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 9 Introduction to Operations Research, Frederick S. Hillier, Gerald J. 7 The Minimum Spanning Tree Problem. The Maximum Lieberman, Ninth Flow Problem. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 9 Introduction to Operations Research, Frederick S. Hillier, Gerald J. 8 The Minimum Cost Flow Problem. LP models for Lieberman, Ninth Network optimization problems and GAMS codes. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 9 9 Introduction to Operations Integer Programming. Prototype example. 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 10 Model Formulation Examples with Binary Variables. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 11

Introduction to Operations Research, Frederick 11 S. Hillier, Gerald J. Model Formulation Examples with Binary Variables. Lieberman, Ninth The Branch-and-Bound Technique. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 11

Introduction to Operations Research, Frederick A Branch-and-Bound Algorithm for Mixed Integer S. Hillier, Gerald J. 12 Programming. The branch and cut approach to Lieberman, Ninth solving binary integer programming problems. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 11 Introduction to Operations Nonlinear programming. One-variable Unconstrained Research, Frederick Optimization. The Bisection Method and Newton’s S. Hillier, Gerald J. 13 Method. Multivariable Unconstrained Optimization. The Lieberman, Ninth Gradient Search Procedure. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 11 Introduction to Operations Research, Frederick Convex Programming. The Karush-Kuhn-Tucker S. Hillier, Gerald J. 14 conditions for constrained optimization. Frank-Wolfe Lieberman, Ninth Algorithm. Edition, 2010 Mc Graw-Hill, Chapter / Kısım 11

SOURCES

Course Notes : Introduction to Operations Research, Frederick S. Hillier, Gerald J. Lieberman, Ninth Edition, 2010 Mc Graw-Hill, ISBN: 978-007-126767-0. Other Sources :  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

KATKI PAYI/ SEMESTER REQUIREMENTS SAYISI/ PERCENTAGE NUMBER OF GRADE Attendance - Participation Lab Application Field Work Special Course Internship Quizzes 3 15 Homework Assignments 5 10 Presentations Project Seminar Mid-Terms 2 35 Final 1 40 TOPLAM/TOTAL 100 PERCENTAGE OF SEMESTER WORK 60 PERCENTAGE OF FİNAL EXAM 40 TOPLAM/TOTAL 100

COURSE CATEGORY Core Courses x Course Category Major area courses (Only one category will be chosen) Supportive Courses Media and management skills courses Transferable skill courses