Generalized assignment problem

<p>In <a href="/facts/Applied_mathematics/qyqklXXm">applied mathematics</a>, the maximum generalized assignment problem is a problem in <a href="/facts/Combinatorial_optimization/PTcloS79">combinatorial optimization</a>.  This problem is a <a href="/facts/Generalization/v0b1pwUx">generalization</a> of the <a href="/facts/Assignment_problem/dIMpM0aW">assignment problem</a> in which both tasks and <a href="/facts/Agent-based_model/C3C1vR8s">agents</a> have a size. Moreover, the size of each task might vary from one agent to the other.
</p><p>This problem in its most general form is as follows: There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost and profit that may vary depending on the agent-task assignment. Moreover, each agent has a budget and the sum of the costs of tasks assigned to it cannot exceed this budget. It is required to find an assignment in which all agents do not exceed their budget and total profit of the assignment is maximized.
</p>

Generalized assignment problem open-in-new

Generalized assignment problem