END    395 Operations Research 2    (3-0-3) 
        TOBB-UNIVERSITY OF    ECONOMICS AND TECHNOLOGY 
          INDUSTRIAL ENGINEERING DEPARTMENT   | 
    
    
      Year,    semester:  
        3rd year, 1st semester  | 
      Prerequisite(s): 
         END294  | 
      Credits    -Lab - Lecture:  
                     3-0-3    | 
      ECTS: 
        6  | 
    
    
      Instructor: 
        Assoc. Prof. Hakan GÜLTEKİN 
        Office: Z82-2, hgultekin@etu.edu.tr  | 
      Assistants:  
         
        To be announced...  | 
    
    
      Course    Description: 
        Integer Programming Models and Solution    Techniques (Branch and Bound, Cutting Planes, Heuristic Methods), Network    Models: Transportation and Assignment Problems, Minimum Spanning Tree,    Shortest Path Problem, Flow Problems and Network Simplex Method. Dynamic    Programming.  | 
    
    
      Course    Book and Reference Books :  
        
          - Operations Research,         Applications and Algorithms by W. Winston         4th edition, Thomson, 2004.
 
          - R. Rardin, “Optimization in Operations Research”, Prentice         Hall, 2000.
 
          | 
    
    
      Course    Learning Objectives: 
        At the end of this course students will    have the ability to: 
        
          - Formulate         real-life problems as mixed integer programming models,
 
          - Solve         their models using commercial software 
 
          - Have an         understanding about the exact solution methods for mixed integer         programming models such as branch and bound and cutting planes,
 
          - Understand         the difficulty of finding an optimal solution for real life problems,
 
          - Appreciate         the usage of heuristic solution methods along with their advantages and         disadvantages
 
          - Have a         basic understanding about dynamic programming models and recursive         equations.
 
          | 
    
    
      Course    Content: 
        
          - Introduction to Integer    Programming and Modeling 
 
          - Optimality and Relaxations
 
          - Branch and Bound Algorithm
 
          - Cutting Plane Algorithm
 
          - Heuristics and Metaheuristics
 
          - Transportation, Assignment,    Transshipment, Shortest Path and Max flow Problems 
 
          - Deterministic Dynamic    Programming
 
         
        Course    Web Site: http://hgultekin.etu.etu.tr/end395.html  | 
    
    
      Tentative    Grading: 
        Midterm                             25% 
        Homework/Quizzes          15% 
        Project/Case    Study          20% 
        Participation                      5% 
        Final                                   35%     | 
    
    
      Course    rules and policies: 
        
          - There will be regular pop-quizzes for which study questions         will be announced earlier. 
 
          - You are allowed to do projects in groups of three. Students         will construct their groups. Late homework or project submissions are         not allowed. 
 
          - Any student involved in cheating in homework assignments or project         will get zero credit and disciplinary action will be taken.
 
          - Do not bring laptops to the lecture unless it is stated         otherwise.
 
          - Any student who comes to the class more than 5 minutes late         will be considered as absent in that lecture. Please do not enter the         classroom if you are more than 5 minutes late in order not to distract         other students.
 
          - A makeup exam will be made for those students with a valid         excuse. In such a case the student should inform the lecturer as soon as         possible by calling or by sending an email and provide the documents         relevant to his excuse to the department office.
 
          | 
    
    
      Contribution    to the Curriculum (Credits)  | 
      Mathematics    and Basic Sciences  | 
      Engineering  | 
      General    Education  | 
    
    
      1  | 
      2  | 
      0  | 
    
    
      Course’s    contribution to the Program Outcomes:   
        a) An ability to apply knowledge of mathematics, science, and    engineering. 
   b) An ability to design and make experiments as well as analyze and    evaluate data. 
          c) An ability to design a system, component, or process to meet    desired needs within realistic constraints such as economic, environmental,    social, political, ethical, health and safety, manufacturability, and    sustainability. 
          e) An ability to identify, formulate and solve engineering    problems. 
          g) An ability to communicate effectively. 
          j) Knowledge of contemporary issues.  
      k) An ability to use techniques, abilities, and modern tools for    engineering applications. 
         | 
    
    
      Prepared    by: 
        Dr. Hakan GÜLTEKİN  | 
      Date: 01.01.2015  |