Homework Assignments
MIM 3531 - Operations Research II
The following problems from the textbook and class packet will be assigned
during the quarter for homework. The boldfaced problems will be collected
and graded.
The use of computer software accompanying the book (courseware) is strongly
encouraged. The symbol "C" to the left of some problems (or their parts)
suggests using the computer with the corresponding automatic routine, depending
on the subject. Similarly, the symbol "T" indicates that a particular template
in the courseware can be helpful.
-
Dynamic Programming. 11.2-1, 11.2-2, 11.3-3, 11.3-4, 11.3-10,
#1
from packet (Knapsack problem), 11.3-13, 11.3-14, 11.3-17,
#
3 from packet for the last three stages only (capacity expansion problem),
11.4-2, #4 from packet for the last two stages only (machine replacement
problem)
-
Markov Chains. Questions 1,2 from packet # 1 (Gambler's ruin
game problem), # 2 from packet (Urn problem), 16.2-1, 16.2-2,
16.2-3, 16.3-1, 16.3-2, 16.3-3, 16.4-1, 16.4-2, 16.4-3,
16.4-5,
#4 from packet (Typewriter repair problem), 16.5-1, 16.5-2,
16.5-3, 16.5-4,
16.5-5, 16.5-9, 16.6-4, 16.6-5,
16.7-2, #5 from packet (Accounts receivable problem)
-
Queueing Theory. 17.2-2, 17.2-3, 17.2-8, 17.2-9,
17.3-1, 17.4-1, 17.5-3 (assume single server), 17.5-8, #1,2,3
from packet (Computer performance, Airport terminal and Bank waiting line
problems)
, 17.6-3, 17.6-28, 17.6-33, 17.7-2 (note
the misprinted number 17.2-2 in the textbook), 17.7-3, 17.7-8
-
Inventory Theory. 19.3-2, 19.3-4, 19.3-14, 19.3-17,
solve 19.4-1 by dynamic programming, then formulate as an integer programming
problem, 19.5-2, 19.5-7