LP_SOLVE 4.0.1.0: optimal, objective 12

priority [*,*] (tr)
:          A   B   C   D   E   J  JM   M    :=
Algo       .   3   .   .   .   .   .   .
Assign     .   .   .   .   .   .   .   5
Baseball   .   .   .   3   .   .   1   1
Binary     .   1   5   .   .   2   4   3
Color      5   5   4   1   .   1   3   2
Count      3   .   2   .   1   .   5   .
GrAppl     2   .   .   5   .   3   .   .
Probab     1   6   1   .   .   .   .   .
Sort       .   2   .   4   .   5   .   .
Tree       4   4   3   2   .   4   2   4
;

assign [*,*] (tr)
:          A   B   C   D   E   J  JM   M    :=
Algo       .   0   .   .   .   .   .   .
Assign     .   .   .   .   .   .   .   0
Baseball   .   .   .   0   .   .   0   1
Binary     .   0   0   .   .   1   0   0
Color      0   0   0   1   .   0   0   0
Count      0   .   0   .   1   .   0   .
GrAppl     1   .   .   0   .   0   .   .
Probab     0   0   1   .   .   .   .   .
Sort       .   1   .   0   .   0   .   .
Tree       0   0   0   0   .   0   1   0
;

## Priorities of assigned projects ##
priority['A','GrAppl'] = 2
priority['B','Sort'] = 2
priority['C','Probab'] = 1
priority['D','Color'] = 1
priority['E','Count'] = 1
priority['J','Binary'] = 2
priority['JM','Tree'] = 2
priority['M','Baseball'] = 1