## Announcements from Professor Jensen

Last updated 8/5/2002

Welcome to the web page for OR 391Q, Network Flow Programming, for the summer semester of 2002. I will modify these pages frequently to allow you to study the course material presented in class, review homework and exam keys and obtain other class related information. Watch this page for announcements.

• Final Exam: It is on Thurs., Aug.1, 9 - 12 noon, CPE 2.220. You may bring the course text and course notes, but not other printed materials or copies.
• Homework 5 Key: It is in the homework key folder.
• Homework 6 (last homework): Read chapter 3 starting on page 131. The homework is from this chapter starting on page 155. Do problems 1, 2, 3, 4, 5, 7, 8, 9, 10.
• For problem 3 add arc 17 entering node 1 with cost 0 and gain 1.
• For problem 7, the basic arcs are: {3, 4, 5, 6, 7}.
• For problem 8, the basic arcs are: {1, 3, 6, 7, 8}.
• For problem 9, the parameters on arc 9 are: (0, 10, 2).
• Contributions: I've linked to pages that have been contributed in the Report Assignment page. If you have submitted a link, check to see if it works. I notice some bad links on some pages. If you would like to submit your completed page to me, I will post in on the class web site.
• Exams on 7/16 and 7/18: Exam 3 will be on 7/16 and cover integer variables and earlier modeling topics. Exam 4 will be on 7/18 and cover algorithms for special purpose problems including: transportation, shortest path, minimal spanning tree and maximum flow problems. Exam 4 will be open book.
• Homework Keys: I've added some of the keys from HW 3. I'll add more as I find them.
• Homework 5: Due on July 18. All problems are from the class notes. You may use the Teach Network add-in, but be able to do an iteration by hand.
• Page 123: Delivery truck routing. Setup but do not solve.
• Page 71: Problems 1 and 2. Starting from the bases given, use the primal simplex algorithm to find optimum solutions. Show the sequence of basic solutions found. On problem 1, make the external flow -1 on all nodes except 1 which will have an external flow of +8.
• Page 78: Do the problem as stated. Starting from the basis given, perform the primal simplex algorithm until you find the optimum solution. Show the triple pointer representation of each basis encountered.
• Page 150 - 156. Do this midterm exam. Do all problems by hand.
• Sample Web pages: These are examples of web sites prepared for another class. You may do something like this for your report. Although they aren't exactly of the form that you will use, they may give you some ideas. Click here to see them.
• Homework 4: Due on July 9
• SPT: Prob. 11
• SPT: Also do Prob. 11 with label correcting algorithm. Start with node labels: (0, 12, 7, 16, 25, 39, 33, 43, 44). The node labels are listed in the order of the nodes, node 1 is 0, node 2 is 12, etc.
• SPT and MST: Prob.14 and 16 do SPT and MST in each case
• Max Flow: Prob.18 and 19. Start with arbitrary feasible flows and do at least one iteration of the labeling algorithm. Find the maximum flow and minimal cut.
• Min. Cost flow: Prob. 22, 23, 24
• Use these initial flows for Problem 18
• Use these initial flows for problem 19. The heavy lines have one unit of flow.
• Review: See short answer questions on pages on 131, 133, and 136. See the sample exam on page 145
• Homework 3: Problems from the class notes: Page 14; page 34 problems 1, 2, 3; page 38. Problems from the text: page 90 problems 8 and 9. For the financial problem click here.
• Homework 1: Problems begin on page 36 of the text. Do problems 1 through 10. Solve all problems and get numerical answers using the Jensen add-ins (Math Programming and Network Solver or Excel Solver).
• Homework submissions should have for each problem
1. Show model, picture for network, matrix for transportation, algebraic model for LP.
2. Give the numerical answer in terms of the problem. The answer should specify results in terms of relevant quantities: workers, hours, product units, etc. Do not provide computer output generated by the add-ins as a mode of presentation.
• Class Text and Notes: You will have to buy two documents published by the University Coop custom publishing. They have been printed and should be available at the Coop. The text for the class is Network Flow Programming, by Paul A. Jensen. The second publication contains the lecture notes. You should bring the lecture notes to class each day because we will use material from it for the lecture.