IE383_Assignment4_sol

IE383_Assignment4_sol - IE 383 Assignment 4 solution Some...

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

View Full Document Right Arrow Icon
IE 383 Assignment 4 solution Some steps are omitted, but you should show your steps in your homework solutions. Problem 1 a) This is a minimax problem w/o consideration of travel frequency. Because we are required to solve this problem graphically, we should use diamond method and we can use the following formula to double check our graphical solution but not substitute for it. The graph is omitted. X Y X + Y Y - X Main office 50 10 60 -40 Nurse room 55 45 100 -10 Doctor room 35 45 80 10 Supplies room 30 25 55 -5 File room 75 25 100 -50 C1 = min (x i + y i ) 55 C2 = max (x i + y i ) 100 C3 = min (-x i + y i ) -50 C4 = max (-x i + y i ) 10 C5 = max (C2-C1,C4-C3) 60 X Y Point 1 52.5 32.5 Point 2 45 25 Optimal point is any point on the line connected by b) Maximum travel distance = C5/2 = 30 or you can solve it from the graph. c) This is a minisum problem that utilizes rectilinear distance w/ consideration of travel frequency (weight). We can solve the problem by using median condition method.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/23/2009 for the course IE 383 taught by Professor Leyla,o during the Spring '08 term at Purdue.

Page1 / 3

IE383_Assignment4_sol - IE 383 Assignment 4 solution Some...

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

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