IE 203 Operations Research II

Credit Information: (3+0+2) 4

Description:

Integer programming: modelling, branch-and-bound method, cutting plane algorithm, linearization, preprocessing and node/variable selection in branch-and-bound; deterministic dynamic programming; nonlinear programming: modeling and examples, unconstrained and constrained optimization; Markov chains; Poisson process and exponential distribution; queueing theory.

Prerequisite: IE 202, IE 255

web: http://moodle.ie.boun.edu.tr/

Offered by:

Necati Aras

Z. Caner Taşkın

Syllabus:

PDF icon IE305_Spring16_Syllabus.pdf