Introduction to Operations Research, 8th Edition, Hillier & Lieberman

 

Week

Sections

Topics

Partial Assignment List

 

 

 

 

 1

3.1-3.6,4.1-4.7

Linear Programming, Simplex Method and Tabular form

3.1(2,4*) 3.2(2*) 3.4(4,7*,8,12) 3.6(3,5) 4.1(2*,4) 4.2(2) 4.3(2,4,6*) 4.4(2,5*)4.5(1) 4.6(1*,5,6) 4.7(1,2(a*,b*),5*)  (Due on Jan. 27)

 2

4.1-4.7, 11.1-11-6

Simplex Method, Integer Programming

11.1(3,4*) 11.3(4*,5) 11.6(1,2*)

(Due on)

 

 3

14.1-2

Game Theory

14.1(2), 14.2(1,2,4,6*)

 

 4

14.3-14.5

10.1-10 .3

Game Theory

Dynamic Programming: Deterministic

14.4(2,3*),14.5(2*,4,8*) (Due on 5:00 pm, Feb. 10)

10.2(1*a,b,c; 2;3b,c;4*), 10.3(1,2*,4) (Due on 5:00 pm, Feb. 24)

 5

10.1-10 .3

Dynamic Programming: Deterministic

Exam 1

 

 6

15.1-15.5

Decision Analysis

15.2(1,5,6*),15.3(1c,5*,12),15.4(1,2,9*) (Due 5:00 pm, March 3)

 7

 

Decision Analysis,  Queuing Theory

Project:

(Due Day: )

 8

17.1-17.3

Queuing Theory: Main Ideas

17.2(2*,3*,4,5,6*,7) (Due 5:00 pm, Thursday, March 12)

 9

17.3-17.5

Queuing Theory

Queuing Theory: Birth-Death

17.4(1,2*,3*,5,7) (Due 5:00 pm, Thursday, March 12)

 

17.5(3,5*,7,8*,9,10,11*)

(Due 5:00 pm, Thursday, March 24)

17.6(1,3,5,7,9*,11*,26*,27*,28) (Due on)

10

Spring Break

 

 

11

17.4-17.6

Queuing Theory: Birth-Death

Exam 2 (Thursday, March 26)

17.6(1,3,5,7,9*,11*,24*,30*) (Due on)

12

17.6-17.8

17.10

Queuing Theory: Models

Application of Queuing Theory

17.7(1*,2,3,4*,5,6*) ,17.8(1,2*,4,5*),

17.10(2*,3) (Due on)

 

 

12

16.1-16.6

Markov Chains

Project  Due on Friday,

16.2(1,2),16.3(1,2*,3),16.4(1,2),

13

16.1-16.6

Markov Chains

16.5(1,4,5,7*),16.6(1*,2,5*)

(Due on Tuesday, April 14)

14

11.1-11-6

Integer Programming

11.1(3,4*) 11.3(4*,5) 11.6(1,2*)

(Due on Thursday, April 23)

15

16

 

Final Exam

Review

Exam Week

 

 

 

 

 

*Problems to hand in.

Notes: 1. Without permission homework past due date will not be accepted.

            2. Homework without the problem statements will not be accepted.

            3. Free exchange of ideas among yourselves is encouraged. But regarding collected homework that exchange must be limited to the verbal kind. You must not complete each other’s ideas, words, or works in any written form. Shared works in all electronic forms are strictly forbidden. These rules certainly do not apply to group projects. The consequence for breaking these rules is for me to divide evenly one score among all sufficiently similar works.

 

Current Week is in Red.

Homework: Problems to hand in will be assigned on Tuesdays and collected on following Tuesdays. There will be at least one group project.  It may require the use of the mathlab in Bessey 105.

 

Hr. Exams                                                     100/exam

Projects                                                           30/each

Presentation                                                        30

HW                                                75 – 100 (10~30/assignment)

Final Exam                                                         200