ise420 algorithmic operations research n.
Skip this Video
Download Presentation
ISE420 Algorithmic Operations Research

Loading in 2 Seconds...

play fullscreen
1 / 8

ISE420 Algorithmic Operations Research - PowerPoint PPT Presentation

  • Uploaded on

ISE420 Algorithmic Operations Research. Asst.Prof.Dr. Arslan M. Örnek Industrial Systems Engineering. Course Objectives:.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about 'ISE420 Algorithmic Operations Research' - noah-hendricks

Download Now An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
ise420 algorithmic operations research

ISE420 Algorithmic Operations Research

Asst.Prof.Dr. Arslan M. Örnek

Industrial Systems Engineering

course objectives
Course Objectives:
  • The course emphasizes the role of optimization in Operations Research. Students will gain an overall perspective in the types of methodologies identified with common optimization problems. Basic theory and computational strategies for exact and heuristic solutions of integer, combinatorial and network flow problems in the context of classical models will be introduced.
  • With the project assignments, the students will gain hands on experience in mathematical programming computation through the use of modeling language OPL and optimization software Cplex.
course outline
Course Outline :

Week Chapter Subject

1 1-2 Problem Solving with Mathematical Models

Deterministic Optimization Models in OR

2 3 Improving Search

3 3 Improving Search (continued)

4 4 LP Models

5 5 Simplex Search for Linear Programming

6 5 Simplex Search for Linear Programming (continued)

7 6 Interior Point Methods

8 Midterm

course outline continued
Course Outline :(continued)

9 7 Duality and Sensitivity

10 8 Multiobjective Optimization and Goal Programming

11 9 Shortest Paths and Discrete Dynamic Programming

12 10 Network Flows

13 11 Discrete Optimization Models

14 12 Discrete Optimization Methods

15 Project presentations

research paper
Research Paper
  • A Research Paper is required with students working individually or in groups of 3-4. Students may propose any optimization-related topic related to this class, but the topic must receive approval.
  • Each Project Group is required to give a 20-min. presentation at the end of semester covering all aspects of their project. The date and format will be discussed in the class.
reading assignments
Reading Assignments
  • All reading assignments must be completed according to the course schedule, and you must be prepared for discussion of weekly reading topics in class. In addition, you will undertake outside readings of articles and texts relevant to topics being discussed and studied in class. Participation in class and team discussions is part of your grade and this will not work well if you have not kept up with the readings.
  • Assignments are due at the BEGINNING of the class period on the designated due date. If you miss class on the due date and your paper is not in at the beginning of class, you will receive a zero on the assignment.

There will be one midterm and one final examination, which will cover reading assignments, lectures, classroom discussions. The midterm examination will be announced at least one week in advance, and will occur as close as possible to the date scheduled in the course outline.

  • Midterm 25%
  • Homeworks 20%
  • Project 20%
  • Final 35%