[algogeeks] how to solve this problem about minimal result?

[fangvv]

Given n point coordinate value {x1,y1}.....{xn,yn} and

weight w1.....wn, How to find point P(X,Y) meet :

X >= min{x1,x2,....xn} , X <= max{x1, x2,.....xn}

Y >= min{y1,y2,....yn} , Y <= max{y1, y2,.....yn}

dis(i, P) = sqrt((yi - Y)*(yi - Y) + (xi - X)*(xi - X))

min{ abs[w1*((y1-Y)/dis(1,P) + ... + wn*(yn - Y)/dis(n,P)] +
abs[w1*((x1-X)/dis(1,P) + ... + wn*(xn - X)/dis(n,P)] }