4) Matchin Problem

Question 1

What even is the problem in a matching thing and what does what represent

Answer 1

It represents a group of people who can say do different jobs
- the connections show what jobs they can do each

Objective is to find a solution which allows everyone to fo on job esch, or the soltuion where this is optimised because it might not be possible

Question 2

Okay so what do you want to maximise then

Answer 2

Maximise the addition of all the path ways , as you want the maximum successful paths

Question 3

How are we showing this down,

Answer 3

Using indicator variable A1 A2 wtc

Question 4

What constraints do you want (2 categories)

Answer 4

First category is that all the jobs person A can do, A1 A2 A3, you want them ti be added to be less than or equal to one

This ensures that either only INE JOB IS PICKED, or none as this may be the optimal solution, and prevents one person having the same job

Do that for all

2) THE SECOND CATAGEORY is if left like this two people might end up having the same job.
Thus now yiu go to each job and do same thing, A1 B1 + C1 is less than equal to 1, here forces if licked the job to be chosen only once

Question 5

Again what are bith cisntsint types for

Answer 5

1st to prevent form having more than one job
2nd to prevent same job done by more than one person