(Through 11/13)
Assignments are listed on the date given. Reading assignments should be completed in preparation for the next class meeting. Written exercises will be due Monday of the following week, unless otherwise noted. Regular written assignments may be submitted in by noon of the following day [via Blackboard] with a 3-point (equivalent to 3/5 of one exercise) penalty - later work will be more heavily penalized. Use of email (in Blackboard) makes it possible to send in assignments at any time. Projects must be submitted on the date due.
Text references are to:
Lawrence & Pasternack, Applied Management Science 2d Ed., John
Wiley & Sons, 2002.
11/13
Read (by 11/15): Section 8.2 (actually example noted last time is in 8.2) and 8.4 - EOQ with quantity discounts
Write (due11/18): p. 492 #15
Print, Read, Bring to Class: Activity 9 (available Thursday)
11/11
Read (by 11/13): Section 8.1 - EOQ model - esp example on p 451ff
Write (due11/18): p. 492 #1
11/8
Test 2 - we will begin work on Inventory systems(Chapter 8) on Monday
11/6
Read (by 11/8):Prepare for Test 2 on Friday
Write (due11/4): No written assignment
11/4
Read (by 11/6): Review Chapters 4, 5 and read the Sample Test questions
Write (due11/4): Prepare for Sample Test exercises on Wednesday
11/1
Read (by 11/4): Begin review of Chapters 4 and 5 for test 11/8
Write (due11/4): No additional written exercises
10/30
Read (by 11/1): Section 5.11There is also a page of notes on managing projects with an Excel Spreadsheet for an example (also available on Blackboard)
Write (due11/4): p312 # 13 (by iterative approach) #23, 24(any method)
Print, Read, Bring to Class: Activity 8 (also available on Blackboard)
10/28
Read (by 10/30): Section 5.10
Write (due 11/4): no new written ssignment
10/18
Read (by 10/28): Section 5.10
Write (due 10/28):P.312 #28, 29. Ex 28 will involve setting up four networks models with the same network structure but different time estimates---use the ``move or copy sheet'' command to make a page for each without re-entering the precedence data, and then change the relevant times (label the sheets so you can remember which is which). Ex 29 involves finding the expected cost (rather than profit) for each choice---remember to include the money paid to the contractor in each case--but no new network setup (if you saved the sheets from Ex 28). The ``99% sure'' date can be found from the appropriate sheet.
10/16
Read (by 10/18): Section 5.9
Write (due 10/24):P.312 #17, 26
Print, Read, Bring to Class: Activity 7 (also available on Blackboard)
Two other useful files (also available through Blackboard) are the Notes on activities with uncertain duration (from 10/16) and the PERT_CPM templates (Excel)
10/14
Read (by 10/16): Section 5.8
Write (due 10/24):P.312 #10, 25
10/11
Read (by 10/14): Sections 5.5 - 5.6
Write (due 10/24):P.312 #6 Draw the network but use Excel for the calculations -- so you should expect to have paper to hand in plus an Excel workbook to send
10/9
Read (by 10/11): Sections 5.1 - 5.3 on Project Networks (PERT, CPM) and the handout (from class) on PERT/CPM in Excel
Write (due 10/14):Text p.312, #2, 4
Print, Read, Bring to Class: Activity 6 (also available on Blackboard)
Two other useful files (also available through Blackboard) are the Instructions for the use of Excel and the Excel worksheet for the Klonepalm example
10/7
Read (by 10/9): Sections 5.1-5.3 on Project Networks (PERT, CPM)10/4
Write (due 10/14):Text p.239(Ch4), #7, 41 and 4, 26, (two problems-shortest path and minimal connector- hidden here), 29
Read (by 10/7): Section 4.6 on Maximal Flow Networks
Write (due 10/7):Text p.239(Ch4), #7 by hand search method from class (see notes handed out). Prepare to ask questions where there are difficutlies. Papaer will not be collected.
10/2
Test 1 - no assignment
9/30
Read (by 10/4): Prepare for T1 on Wednesday 10/2
9/27
Read (by 10/4): Section 4.6 on Maximal Flow Networks
Write (due 9/30):Text p.239(Ch4), #6, 18, 22
9/25
Read (by 9/27): Section 4.5 in Text - Shortest Path networks. Also read the supplement on Dijkstra's algorithm on the text CD (in Supp 05) also available on the Blackboard site
Write (due 9/30):Text p.239(Ch4), #3, 50a (on supplementary problems list - on CD, available on Blackboard)
Print, Read, Bring to Class: Activity 5(also available on Blackboard)
9/23
Read (by 9/25): Sections 4.1 and 4.3 in Text - network models, specifically capacitated transshipment networks - we will then skip to Shortest path models (4.5) (including a hand solution model - which is also described in the Supplemenatl notes on the CD)
Write (due 9/30):Text p.239(Ch4), #25
9/20
Read (by 9/23): Section 4.4 in Text
Write (due 9/23):Text p.239(Ch4), #31,38
9/18
Read (by 9/20): Notes on Distribution models-assignment models
Write (due 9/23): On the Transportation/production assignment models sheet: #2,3 (Excel) - add additional sheets for revisions to problems (so solver setup is retained for each)
Print, Read, Bring to Class: Activity 4(also available on Blackboard)
9/16
Read (by 9/18): Note on Distribution models
Write (due 9/23): On the Transportation/production assignmen tmodels sheet: #1 by hand (as shown in class) - We'll move to computer solution (and to extensionsof the model) on Wedensday
9/13
Read (by 9/16): The notes on Distribution Models handed out today (also on Blackboard - Notes area, Distribution Models folder). We will be working with an alternative approach to the material in 4.2 and 4.4 of the text.
Write (due 9/16): p. 168: #33, 39
9/11
Read (by 9/13): In text: 3.4 (notice the setup considerations - constraints, etc. - but don't worry about the various Excel constructions)
Write (due 9/16): No additional written assignment
Print, Read, Bring to Class: Activity 3(also available on Blackboard).
9/9
Think of Career-type questions you'd like to ask of Emily on Wednesday
Read (by 9/13): In text: 3.4 (notice the setup considerations - constraints, etc. - but don't worry about the various Excel constructions)
Write (due 9/16): p. 168: #1, 4, 9, 29, 30 (29 & 30 will use binary variables)
9/6
Read (by 9/9): In text: 2.7 (special solution situations)
Write (due 9/9): p. 101: #9, 26 (for now, don’t worry about whole number of pies)
9/4
Read (by 9/4): In text: Section 2.4 (again)
Write (due 9/9): p. 101: #5, 8, 19
Print, Read, Bring to Class: Activity 2(also available on Blackboard). You will need the Excel workbook Toycoproduction.xls
9/2
Read (by 9/4): In text: Section 2.4
Write (due 9/9): p. 101: #6 (setup c as a new problem - use move/copy sheet command), #11 Show formal setup (variables, objective, constrraints) - use "insert Text Box"
8/30
Read (by 9/2): In text: Section 2.5
Write (due 9/2): p. 101: #3, 10 [you can answer a, b by evaluating the objective at appropriate points], 17 [invest minimum amont of money, not month]
8/28
Read (by 8/30): In text: Sections 21. - 2.3
Write (due 9/2): p. 101, #1, 2a
Print, Read, Bring to Class: Activity 1(also available on Blackboard); There are also two more worked setup and solution examples in the document
LPsetup-graph(also available in the Notes & Examples > Linear Programming Models folder on Blackboard)
8/26
Read (by 8/28): In text Chapter 1
Write (due 9/2): p. 40, #4, 5, 7
Last update 8/15/2013
Maintained by cpeltier@saintmarys.edu