IE 251 Operations Research I Fall 2010

Instructor: Esra Karasakal

(Office: IE 211, Phone: 210 2278, E-mail: esra@ie.metu.edu.tr)

Assistants: Tlin nkaya

(Office: IE 321, Phone: 210 2956, E-mail: tulin@ie.metu.edu.tr)

Banu Lokman
(Office: IE 320, Phone: 210 4794, E-mail: banutuna@ie.metu.edu.tr)

Course homepage: http://online.metu.edu.tr/

IE 251 Operations Research I

Course Objectives: The students are expected to gain the following: Have an understanding of the general principles, underlying assumptions and application areas of linear programming. Acquire the skills to formulate and build linear programming models. Understand how to solve linear programming problems using the simplex method, the duality and relation with optimality, and how to make sensitivity analysis.

IE 251 Operations Research I

Course Objectives: (contd) Become familiar with the special types of linear programming problems such as transportation, transshipment, assignment and network problems. Learn to solve large scale linear programs using software, to interpret software output and perform sensitivity analysis. Learn to deal with the multi-criteria decision making problems.

IE 251 Operations Research I

Textbook: Winston W.L., Operations Research (4th ed.), Duxbury, 2004.
References: Hillier F.S. and Lieberman G.J., Introduction to Operations Research (9th ed.), McGraw-Hill, 2010 (T57.6 .H54 2010 in reserve). Taha, H.A., Operations Research (8th ed.), Prentice Hall, 2007 (T57.6 .T3 2007 in reserve). Any text on Operations Research and Management Science.

Computer Packages: EXCEL, GAMS

IE 251 Operations Research I

Tentative Course Schedule:
WEEKS SUBJECT 1 2 3-4 5-6 7-8 9-10 11-12 13-14 History and methodology of operational research Methodology of operational research Linear programming models Linear programming solutions Linear programming solution methods Duality Transportation problems and solution methods Multiple criteria decision making DETAILS History and methodology of operational research, problem solving phases of a project Methodology of operational research, systems thinking, application examples Basics of model formulation, graphical solution Computer solutions, interpretation of results Simplex algorithm, sensitivity analysis Duality theory, sensitivity analysis Transportation, assignment and transhipment problems, models, solution methods Decision making with multiple objectives, efficient points and frontier, goal programming

IE 251 Operations Research I

Lecture hours: Section 01 Section 02
Monday Tuesday Monday Tuesday 13:40-15:30 12:40-13:30 12:40-13:30 10:40-12:30 IE 03 IE 03 IE 301 IE 301

Recitation hours: Section 01 Section 02

Quiz hour:

Friday Friday

08:40-09:30 09:40-10:30

IE 301 IE 103

Sections 01, 02

Friday 12:40-13:30

IE 251 Operations Research I

Grading: Quiz

20% (= 5 4% )

(Quizzes 1-5: Oct. 20@17:40, Nov. 5, Dec 3, Dec. 17, Dec. 31)

Case Study 20% (= 7% +13%) (Cases 1-2, Due-dates: Nov. 11, Jan 6)
Midterm exam 25% (Nov. 30)

Final exam

35%

Prerequisite Chain in IE Undergraduate Curriculum