5) Allocation Problem

Question 1

What is it asking to do

Answer 1

It cost a machine this money ti do each task

Each task must be completed and each machine used

You want the least moneyn

Question 2

How to do , what to minimise
Are we using indicator

Answer 2

Use indicator,

Minimise their total distances if everything picked = arc weight x indicator and add all up

Question 3

How to do constraints

Answer 3

Since each task must be picked once, sum them to 1
Since each machine must be picked once, Sum them to 1

Question 4

What value do you hope best case scenario thr prorgaamrme returns

Answer 4

The total number of things, you would hope a match is found for everyone