The assignment problem is some of the significant combinatorial
optimization difficulties in the division of operations research in mathematics.
It contains of looking for a supreme weight matching in a weighted bipartite
graph. The assignment problem constraint means that agent 3 can be assigned
to no more than two tasks.
look at the picture .................
the answer is 400
Answer:
x=48
Step-by-step explanation:
4x+5x+6x=180
15x=180
x=12
4x=48
Bisector => AD = CD => 3y+6 = 5y-18 => 2y = 24
=> y=12
12 should be 1 as in 1 foot. 1' 1/4"
