Chapter 9, Problem 2P

(a)

Program Plan Intro

To argue that the median $x1,x2,\mathrm{......}xn$ is the weighted median of the $xi$ with weight $wi=1/n$ for $i=1,2,\mathrm{....},n$ .

(b)

Program Plan Intro

To explain the procedure to computes weighted median of n elements using sorting technique.

(c)

Program Plan Intro

To explain the procedure to computes weighted median of n elements usinglinear-time median algorithm.

(d)

Program Plan Intro

To argue that the weighted median is the best solution for the 1-dimension post-office location problems using distance between a and bbe $d(a,b)=|a-b|$ .

(e)

Program Plan Intro

To find the best solution for the 2-dimension post-office location problem using distance function $d(a,b)=|x1-y1|+|x2-y2|$