I have a fixed number of resources "N" and I want to distribute these "N" resources among "K" entities (or consumers).
I can allow maximum "q" entities to simultaneously share any resource.
All resources are not identical, some are best, some are average and some worst performing resources are there out of "N" resources.
Can anybody tell me how to do the above distribution efficiently and fairly? By "efficiency" I mean full utilization of resource and by "Fairness" I mean to be fair with every entity.
Thank you for any suggestions.
Vinay Trivedi
IIT Patna, India
Linear Programming seems a natural approach to this problem, your model could consider Xij = 1 when entity i consumes resource j, 0 othercase. Your constraints must consider that Sum(j) Xij = q. However you need to define your fair function to maxime it or unfair to minimize it, for example, If Dij is the difference beetween entities ei and ej, then a feasible function to minimize is Sum(i)(j) Dij.
Best regards
Thank you Dr. Carlos Cares for your response.
I have another question at:
https://www.researchgate.net/post/Is_it_possible_to_find_DCT_coefficients_from_DST_coefficients_or_vice_versa
Please see if you could help me with this.
- Badges
- Science topic
- Similar topics
- Geoscience
- Asia
- India