I have an optimization problem where I have a set of providers P
selling objects Op
of different types with different performance vectors Pv=[p1, p2, p3, ..., pn]
and a set of client requests R
asking for objects Or
with an expected performance vectors Er=[e1, e2, ..., en]
.
I would like to compute what are the provider's objects that are close enough to the ones requested by clients given the performance vectors, I have looked at some measures like : Euclidian squarred distance but I am not sure how to use it since the units of the performance vectors are different i.e p1 is measured in seconds, p2 is measured in dollars and so on...
Could anyone shed some light and suggest a methodology ?