Verena Gonzalez Lopez, 2011 - Institut für Tierzucht und Tierhaltung ...

The general problem of selecting mating pairs in linear programming can described
as follows:
minimize
∑∑
i j
F
ij x ij
subject to the restrictions
x = 0 or 1
ij
∑ xij
= 1
i
∑ x ij
= contribution allocated by optimum algorithm,
j
where
F
ij
is the estimated coancestry between the i th male and j th female and x
ij
is the number of progeny from the ij th mating pair, restricted to 0 or 1.
Results
Selection of candidates according to performance requirement
Average EBV, R-value, inbreeding coefficients, number of tested progeny and their
performance are summarized for potential and selected candidates in Table 1 and 2.
The average EBV of selected candidates was considerably higher compared to those
of potential candidates. As expected, in all traits the performance of tested progeny
of selected candidates was superior to the potential candidates. Moreover, the
selection of candidates according to performance requirements reduced the average
inbreeding slightly due to a substantially lower maximum value. Whereas the
relationship value of selected candidates increased a little. Both, potential BW boars
and selected BW boars have on average a lower relationship value; although the
maximum value is comparable with the value of SH boars.
43