{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw3 soln

# hw3 soln - IE 383 Assignment 3 solution Some steps are...

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

IE 383 Assignment 3 solution Some steps are omitted, but you should show your steps in your homework solutions. Note: all questions in this assignment are discrete location decision-making problems Problem 1. a.) 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. X Y W Main office 40 10 25 Nurse room 50 45 35 Doctor room 40 45 30 Supplies room 30 25 12 File room 55 25 15 Sum 11 7 Sum of W= 117 Sum of W/2 = 58.5 X W Cumulative W 30 12 12 40 30+25 67 50 35 102 55 25 117 Optimal X coordinate is 40. Y W Cul W 10 25 25 25 12+15 52 45 30+35 117 Therefore the optimal point is at (40, 45) b.) This is a minisum problem that utilizes straight-line distance w/ consideration of travel frequency (weight). We can solve the problem by using center of gravity method.

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

View Full Document
Total weight=117 X*W Y*W Main office 1000 250 Nurse room 1750 1575 Doctor room 1200 1350 Supplies room 360 300 File room 825 375 Sum 5135 3850 X* = Sum(Xi * Wi) / Sum (Wi)= 43.89 Y* = Sum(Yi * Wi) / Sum (Wi)= 32.91 The optimal location is at (43.89, 32.91) c.) This is a minimax per trip 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.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 5

hw3 soln - IE 383 Assignment 3 solution Some steps are...

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

View Full Document
Ask a homework question - tutors are online