ESI6314_sample_exam2_fall10

ESI6314_sample_exam2_fall10 - Sample Exam # 2 ESI 6314...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Sample Exam # 2 ESI 6314 Deterministic Methods in Operations Research 1. (20 points) Valdosta Tile Co. has two clay mining pits, P1 and P2, each of which supplies 15 tons of clay per month to three tile making kilns, K1, K2 and K3, each of which require 10 tons of clay per month. The shipping costs ($ per ton) are given in the table below: a) Formulate a transportation linear program to minimize shipping costs b) Determine a “Northwest Corner Rule” basic feasible solution for this problem. Calculate the total transportation cost associated with this solution. c) Perform one iteration of the transportation simplex method. What do you observe?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
(20 points ) Think of the network shown in Figure as a highway map, and the number recorded next to each arc as the travel time for each arc. A traveler plans to drive from node 1 to node 12 on this highway. Find the best path for this traveler using Dijkstra’s algorithm. 1
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 6

ESI6314_sample_exam2_fall10 - Sample Exam # 2 ESI 6314...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online