-
Notifications
You must be signed in to change notification settings - Fork 0
New LP Formulation
-
$P\in\mathcal P$ persons -
$R\in\mathcal R$ rooms -
$A\in\mathcal A$ AKs -
$T\in B\in\mathcal B$ , where$T$ is a timeslot within a time block$B$ (usually a day), we write$\mathcal T:=\cup B$
-
$D_A$ : duraction of an AK -
$C_R$ : capacity of a room -
$P_{A,P}\in{0,1,\mu} $ : preference of$P$ (the higher the more important participation at$A$ ) -
$n$ number of people ($\mathcal H^0(\mathcal P)$ )
-
$F_{A,X}$ denotes wether AK$A$ interacts with$X$ - if
$X\in\mathcal P$ ,$F_{A,X}$ iff$X$ participates at$A$ - TODO: other cases
We maximize the ratio of preferences fulfilled for each person:
We normalize the value for each person by the number of positive preferences to encourage people to set few preferences.
Here
Each AK gets exactly one room.
There are some more constraints, eg. some AKs need a beamer and only some rooms offer them
more on how this is implemented can be read in the input specification