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

(Currently under revision, please check its update weekly.)

 

Week

Sections

Topics

Partial Assignment List

 

 

 

 

 1

3.1-3.6,4.1-4.7

Linear Programming, Simplex Method and Tabular Form

3.1(3,5*) 3.2(2*) 3.4(5,8*,9,12) 3.5(4,6)

 1

4.1-4.7,

Simplex Method and

Tabular Form, Shadow Price

4.1(2,4) 4.2(2) 4.3(3,5,7*) 4.4(2,5*(b*,c*)) 4.5(1)  4.6(1(b),3*(a*,b*),5,6,7*(a*,b*))  

 

 1

4.7, 6.1

15.1-2

Duality

Game Theory

4.7(1,2(a,b),5) ,  6.1(3,4,5*)

15.1(2)

 

 2

15.3-15.5

11.1-11.3

Game Theory

Dynamic Programming: Deterministic

15.2(2,4,6*) ,15.4(3,4*),15.5(3*,5,9*) 

11.2(1*a,b,c; 2;3b,c;4*)

 2

11.1-11.3

Dynamic Programming: Deterministic

      Review

Exam 1

11.3(2,3*,5)

 

Project:

 2

17.1-17.3

Queuing Theory: Main Ideas

17.2(2*,3*,4,5,6,7,8*) 

 

        3

17.3-17.4

Queuing Theory

17.4(1,2*,3*,5,7)

3

 

3

 

4

17.4-17.6

 

17.4-17.6

 

Queuing Theory: Birth-Death Process

Queuing Theory: Birth-Death Process

Queuing Theory: Birth-Death Process

Exam 2

 

 

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

 

 

       17.6(2,4,6,8*)

 

 

       17.8(1,2,5)

   

S29.1- S29.6

Markov Chain

S29.2(2*,3*), S29.3(1*,2,3), S29.4(1,2),

4

S29.1- S29.6

Markov Chains

S29.5(1,4,5,7*), S29.6(1*,2,5*) , S29.7(1,2)

5

12.1-12-6

Integer Programming

12.1(3,4*) 12.3(4*,5) 12.6(1,2*)

5

5

 

Exam Week

Catch up and Review

Final Exam

 

 

 

 

 

--- Problems with ‘*’ next to them are to be handed in on updated due dates.

Notes: 1. Homework past due date will not be accepted unless permission is granted in advance.

            2. Homework without problem statements will not be accepted.

            3. Exchange of ideas is encouraged. But with regard to collected homework such exchanges must not be shared in writing. This rule does not apply to group projects within the group but does apply between groups. The consequence for violating this rule is for me to divide evenly one score among all sufficiently similar works.

 

There will be one group project if time permits.  It may require the use of the Matlab, a computer algebraic system which is made available free of charge to all UNL students. To install Matlab, go to http://procurement.unl.edu/matlab-licenses

 

Points to be accumulated through the semester:

 

Hr. Exams                                                                   100/exam

Projects                                                                          20/each

Presentation                                                                       20

HW                                                                 75 – 100 (1~6/assignment)

Final Exam                                                                        200

 

        The standard number-to-letter grade conversion will be used for your course grade.