Optimization of price

209 Views Asked by At

I have following: M resoruces N services, P records where 0 < M,N,P Record - is a pair of service (with duration), resource.

So, I need to propose best prices for less busy resources. How to compute this?

Sample: I have a car box where I am washing cars.

Working day from 8.00-20.00

30 Min cost normally 10 $.

Based on historical data, I can tell that:

Probability 0.9 that car came to wash from 8.00-10.00, 15.00-19.00

Probability 0.6 that car came to wash from 10.00-11.00

Probability 0.3 that car came to wash from 11.00-15.00

I want to set discount where low probability, to maximize load actually, for example:

10.00-11.00 will cost 6$ - to maximize outcome, increase load

11.00-15.00 will cost 4$ - to maximize outcome, increase load