Genet. Sel. Evol.
Volume 39, Number 1, January-February 2007
|Page(s)||3 - 25|
Optimisation of contribution of candidate parents to maximise genetic gain and restricting inbreeding using semidefinite programming (Open Access publication)Ricardo Pong-Wong and John A. Woolliams
Roslin Institute (Edinburgh), Roslin, Midlothian, EH25 9PS, Scotland, UK
(Received 19 February 2006; accepted 18 August 2006 ; published online 11 January 2007)
Abstract - An approach for optimising genetic contributions of candidates to control inbreeding in the offspring generation using semidefinite programming (SDP) was proposed. Formulations were done for maximising genetic gain while restricting inbreeding to a preset value and for minimising inbreeding without regard of gain. Adaptations to account for candidates with fixed contributions were also shown. Using small but traceable numerical examples, the SDP method was compared with an alternative based upon Lagrangian multipliers (RSRO). The SDP method always found the optimum solution that maximises genetic gain at any level of restriction imposed on inbreeding, unlike RSRO which failed to do so in several situations. For these situations, the expected gains from the solution obtained with RSRO were between 1.5-9% lower than those expected from the optimum solution found with SDP with assigned contributions varying widely. In conclusion SDP is a reliable and flexible method for solving contribution problems.
Key words: inbreeding restriction / optimisation of contributions / semidefinite-programming
Correspondence and reprints: firstname.lastname@example.org
© INRA, EDP Sciences 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.