190
Appendix
Table 3 Objectivefunctionandconstraintsoftaxonselectionproblemsforthepheasantexample
Maximize λλ
11 yy+...+ 2020
(1)
Subject to
Size constraint: xxxxxxxxxxk
PB++PC PE++PG PI++PM GG++GL GS+≤GV
(2)
Binary constraints: xi
i∈{,^01 }∀taxon
(3)
yσ∈∀{} 01 , σ= 12 ,.., 0 (4)
Split constraints: yx i
ii≤∀taxon
(5)
yx 11 ≤+PB xPC
yx 11 ≤+PE xxPG++PI xxPM++GG xxGL++GS xGV
yx 12 ≤+PB xxPC+PI
yx 12 ≤+PE xxPG++PM xxGG++GL xxGS+GV
yx 13 ≤+PB xxPC++PG xPI
yx 13 ≤+PE xxPM++GG xxGL++GS xGV
yx 14 ≤+PB xxPC++PG xxPI+ PM
yx 14 ≤+PE xxGG++GL xxGS+GV
yx 15 ≤+PB xxPC++PE xxPG+ PI
yx 15 ≤+PM xxGG++GL xxGS+GV
yx 16 ≤+PB xxPC++PE xxPG++PI xPM
yx 16 ≤+GG xxGL++GS xGV
yx 17 ≤+PB xxPC++PE xxPG++PI xxPM+GS
yx 17 ≤+GG xxGL+ GV
yx 18 ≤+PB xxPC++PE xxPG++PI xxPM++GG xGS
yx 18 ≤+GL xGV
yx 19 ≤+PB xxPC++PE xxPG++PI xxPM+GV
yx 19 ≤+GG xxGL+ GS
yx 20 ≤+PB xxPC++PE xxPG++PI xxPM++GL xGV
yx 20 ≤+GG xGS
(continued)
O. Chernomor et al.