(Through 12/7/07)
Assignments are listed on the date given. unless otherwise noted, they are due at the next class meeting. Regular written assignments may be handed in by noon of the following day with no penalty, or at the next class meeting with a 3-point (3/5 of one exercise) penalty - later work will be more heavily penalized. Assigned reading must be completed before the next class. Projects must be submitted on the date due.
Text references are to:
Lawrence & Pasternack, Applied Management Science 2d Ed., John
Wiley & Sons, 2002.
12/7(due 12/10)
Write:[corrected assignment]Markov chains exercises #12, 15, 16, 17a,c
12/3(due 12/7)
Write:Markov chains exercises #6 - 10
12/3(due 12/5)
Write:Markov chains exercises #1, 2, 4, 5
11/30(due 12/3)
Write:Text : p.492 # 6, 25, 26 (goodwill cost is negative because the company feels that unfilled orders increase their prestige and make the items more desirable), 34, 44 (note the salvage value is negative – we have to pay to dispose of unsold items)
11/28(due 11/30)
Write:Text p492 # 3, 8, 21, 30
11/26(due 11/28)
Write:Text p492 # 2, 10, 20
11/19(due 11/26)
Write:Text p492 # 1, 7, add 13-16
11/16(due 11/19 - postponed to 11/26)
Write:Text p492 # 1, 7
11/14
Test 2 no new assignment
11/12(due 11/19)
Write:No new written assignment
11/9(due 11/12)
Write:Text p312 # 5, 19
11/7(due 11/9)
Write:No new written assignment
11/5(due 11/7)[postponed to 11/9]
Write:Text p312 # 8, 9, 23, 24
11/2(due 11/5)
Write:No new written assignment
10/31(due 11/2)
Write:Text p.312 (Ch 5) #20, 27
10/29(due 10/31)
Write:Text p.312 (Ch 5) #16, 17
10/19(due 10/31)
Write:Text ) p.312 (ch 5) # 6, 10, 18 [can be done by hand, calculations can also be done with Excel worksheet]
10/17(due 10/19)
Write:Text p. 239 (Ch 4) #26 [involves both minimal connector and shortest path - note you must disregard the directions for minimal connector], p.312 #3,4 (by hand - you have to draw the network anyway)
Print, read, bring to class on Friday: Activity 7 There is also a spreadsheet model showing the formulas
10/15(due 10/17) -adjusted to 10/17
Write:Text p. 239 (Ch 4) #7, 41, 43 (# 7 by hand) , also #4, 13 (by hand - there isn't a spreadsheet template)
10/12(due 10/15) -adjusted to 10/17
Write:Text p. 239 (Ch 4) #7, 41, 43 (# 7 by hand)
10/10(due 10/12)
Write:Text p. 239 (Ch 4) 6, 18, 22, 27 Due date adjusted to 10/12
Print, read, bring to class on Friday: Activity 6
10/8(due 10/10)
Write:Text p. 239 (Ch 4) 6, 18, 22, 27 Due date adjusted to 10/12
10/5(due 10/8)
Write:Text p. 239 (Ch 4) #3 (set capacities for links at 8500 - or above), 12 (this is a repeat to see how straight transportation problem works in this setting) 17 (set all transportation costs at $1 per unit - really interested in whether there is a feasible solution) 49bc, 50a [These are on the CD that comes with the text [PDF files> additional problems > addprobsch04.pdf] - capacities in links are not limited, so set all above the number of cars]]
10/3(due 10/5)
No new written assignment
Print, read, bring to class on Friday: Activity 5
10/1(due 10/3)
No new written assignment
9/28(due 10/1)
No new written assignment
9/24(due 9/26)
Write: p. 239 (Ch 4) #2, 9, 15, 38
9/21(due 9/24)
Write: p. 239 (Ch 4) #8c,d (need to add additional constraints - can add new rows below the "solutions" table and new constraints in Solver), 12, 21, 30, 32
9/19(due 9/21)
Write: p.239 ex 1 using the hand solution method from class - note you need to add a dummy. (problem is unbalanced)
Print, read, bring to class on Friday: Activity 4 there is also a spreadhseet setup example (which you will have available for comparison in class - you do not need to print it) here
9/17(due 9/19)
Write: No new written assignment
9/14(due 9/17)
Write: Text p. 168 #30, 37, 38
For # 30: The binary variable for Òuse the Michigan plantÓ, for example , must be 1 if anything is built in Michigan. One way to do this (asssuming the variable is called XM, so XM = 0 if Michigan not used, 1 if Michigan used) is
60XM - (#cars from Mich + # vans from Mich + # buses from Mich) >= 0 - the 60 comes from the fact that at most 60 vehicles (30 + 20 + 10) can be made in Michigan - XM will have to be positive if any of the Michigan variables are positive, but can be 0 if no vehicles are made in Michigan). Any number that is at least as large as the maximum number of vehicles to be made could be used in place of the 60
9/12(due 9/14)
Write: Text p. 168 #1, 28, 29
Print, read, bring to class on Friday: Activity 3
9/10(due 9/12)
Write: Text p. 101: #26, 27
9/7(due 9/10)
Read:In text sections 2.7 - 2.9[Lack of unique optimal solution, an extended example, Integer linear programming],
Write: Text p. 101: #9, 28, 29
9/5(due 9/7)
Write: Text p. 101: # 4, 5, 8, 19, 24 [answer the questions - send Excel solutions to me as attachments, but also write out the setups - you have already set up #4]
Print, read, bring to class on Friday: Activity 2[The Excel spreadsheet - not needed unitl you are doing the activity - is available through the Blackboard site - Course documents section, Linear Programming Notes folder]
9/3(due 9/5)
Reread:In text sections 2.4-2.5 [Two topics: Sensitivity and Excel solution],
Write: Text p. 101: # 6, 16
8/31(due 9/3)
Read:In text sections 2.4-2.5,
Write: Text p. 101: #3, 10 [you can answer a, b by evaluating the objective at appropriate corners of the feasible region], 11[but read available cloth as 4200 linear feet, or problem can’t be set up], 17 [invest minimum amont of money, not month]
8/29(due 8/31)
Read:In text sections 2.1-2.2
Write: Text exercises p.101 # 1, 2(a)
Print, read, bring to class on Friday: Activity 1
8/27(due 8/29)
Read:In text (quickly) sections 1.1-1.6,
Write: Text exercises p.40 # 4-7
Last update 8/16/07
Maintained by cpeltier@saintmarys.edu