Robust Optimization for Selection of Genotypes with Maximum Genetic Gain
碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 107 === In this thesis, we first review the three conic relaxation: SDP (Semi-definite programming), LP (Linear programming), and SOCP (Second-order cone programming), proposed in S. Safarina et al.(2017) for the optimum selection of genotypes that maximize genetic...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/g6v7bz |
| id |
ndltd-TW-107NCKU5507004 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-107NCKU55070042019-10-25T05:24:18Z http://ndltd.ncl.edu.tw/handle/g6v7bz Robust Optimization for Selection of Genotypes with Maximum Genetic Gain 使用Robust 優化技巧以選擇具有最大獲益的基因型態 Sing-HuaCai 蔡幸樺 碩士 國立成功大學 數學系應用數學碩博士班 107 In this thesis, we first review the three conic relaxation: SDP (Semi-definite programming), LP (Linear programming), and SOCP (Second-order cone programming), proposed in S. Safarina et al.(2017) for the optimum selection of genotypes that maximize genetic gain. Then, we consider the robust optimization to the LP relaxation and incorporate with a steepest ascent method to acquire an appropriate solution for the equal deployment(ED) problem subject to uncertainty data. At last, we conduct numerical experiments to test the feasibility incurred by the perturbation. Ruey-Lin Sheu 許瑞麟 2019 學位論文 ; thesis 79 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 107 === In this thesis, we first review the three conic relaxation: SDP (Semi-definite programming), LP (Linear programming), and SOCP (Second-order cone programming), proposed in S. Safarina et al.(2017) for the optimum selection of genotypes that maximize genetic gain.
Then, we consider the robust optimization to the LP relaxation and incorporate with a steepest ascent method to acquire an appropriate solution for the equal deployment(ED) problem subject to uncertainty data.
At last, we conduct numerical experiments to test the feasibility incurred by the perturbation.
|
| author2 |
Ruey-Lin Sheu |
| author_facet |
Ruey-Lin Sheu Sing-HuaCai 蔡幸樺 |
| author |
Sing-HuaCai 蔡幸樺 |
| spellingShingle |
Sing-HuaCai 蔡幸樺 Robust Optimization for Selection of Genotypes with Maximum Genetic Gain |
| author_sort |
Sing-HuaCai |
| title |
Robust Optimization for Selection of Genotypes with Maximum Genetic Gain |
| title_short |
Robust Optimization for Selection of Genotypes with Maximum Genetic Gain |
| title_full |
Robust Optimization for Selection of Genotypes with Maximum Genetic Gain |
| title_fullStr |
Robust Optimization for Selection of Genotypes with Maximum Genetic Gain |
| title_full_unstemmed |
Robust Optimization for Selection of Genotypes with Maximum Genetic Gain |
| title_sort |
robust optimization for selection of genotypes with maximum genetic gain |
| publishDate |
2019 |
| url |
http://ndltd.ncl.edu.tw/handle/g6v7bz |
| work_keys_str_mv |
AT singhuacai robustoptimizationforselectionofgenotypeswithmaximumgeneticgain AT càixìnghuà robustoptimizationforselectionofgenotypeswithmaximumgeneticgain AT singhuacai shǐyòngrobustyōuhuàjìqiǎoyǐxuǎnzéjùyǒuzuìdàhuòyìdejīyīnxíngtài AT càixìnghuà shǐyòngrobustyōuhuàjìqiǎoyǐxuǎnzéjùyǒuzuìdàhuòyìdejīyīnxíngtài |
| _version_ |
1719277936858628096 |