This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: OR Models Problem Set # 3 Fall Semester 2011 Due: Thursday, October 6 For each problem: Construct (i.e., draw and label ) the network of the associated minimum-cost flow problem. Unless indicated otherwise, solve the problem using the OR MS Network add-in. Report the solution and attach a printout of the Excel work- sheet. 1. Solve problem 2 from Chapter 5 of Jensen and Bard. 2. Solve problem 16 from Chapter 5 of Jensen and Bard. Note that this will be a network flow problem with (non-unit) gains. 3. SXSW Airlines is considering entering the East Coast market. Table 1 contains a list of candidate flight-legs with associated costs and revenues, between Boston, New York, and Washington DC, to which SXSW can assign planes. At most one plane can be assigned to each leg, and no leg has to be covered. For purposes of this model you may assume that an aircraft that lands at an airport at, say, 10am is eligible to immediately depart on another leg but may also remain on the ground until a later flight. Each plane that is assigned to this East Coast system incurs a fixed operating cost of $8000/day. The schedule in Table 1 is repeated each day, and you may assume that aircraft fly identical schedules each day. No deadhead (i.e., empty, repositioning)that aircraft fly identical schedules each day....
View Full Document
This note was uploaded on 12/19/2011 for the course M E 366l taught by Professor Staff during the Fall '08 term at University of Texas at Austin.
- Fall '08