Optimization Online


Conic relaxation approaches for equal deployment problems

Sena Safarina(safarina.s.aa***at***m.titech.ac.jp)
Satoko Moriguchi(satoko5***at***tmu.ac.jp)
Tim J. Mullin(tim.mullin***at***skogforsk.se)
Makoto Yamashita(Makoto.Yamashita***at***is.titech.ac.jp)

Abstract: An important problem in the breeding of livestock, crops, and forest trees is the optimum of selection of genotypes that maximizes genetic gain. The key constraint in the optimal selection is a convex quadratic constraint that ensures genetic diversity, therefore, the optimal selection can be cast as a second-order cone programming (SOCP) problem. Yamashita et al. (2015) exploits the structural sparsity of the quadratic constraints and reduces the computation time drastically while attaining the same optimal solution. This paper is concerned with the special case of equal deployment (ED), in which we solve the optimal selection problem with the constraint that contribution of genotypes must either be a fixed size or zero. This involves a nature of combinatorial optimization, and the ED problem can be described as a mixed-integer SOCP problem. In this paper, we discuss conic relaxation approaches for the ED problem based on LP (linear programming), SOCP, and SDP (semidefinite programming). We analyze theoretical bounds derived from the SDP relaxation approaches using the work of Tseng (2003) and show that the theoretical bounds are not quite sharp for tree breeding problems. We propose a steepest-ascent method that combines the solution obtained from the conic relaxation problems with a concept from discrete convex optimization in order to acquire an approximate solution for the ED problem in a practical time. From numerical tests, we observed that among the LP, SOCP, and SDP relaxation problems, SOCP gave a suitable solution from the viewpoints of the optimal values and the computation time. The steepest-ascent method starting from the SOCP solution provides high-quality solutions much faster than an existing method that has been widely used for the optimal selection problems and a branch-and-bound method.

Keywords: Semidefinite Programming; Second-order cone programming; Mixed-integer conic programming; Conic Relaxation; Tree Breeding; Equal development problem

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: Report Number: B-485 Department of Mathematical and Computing Sciences Tokyo Institute of Technology March 2017

Download: [PDF]

Entry Submitted: 03/07/2017
Entry Accepted: 03/07/2017
Entry Last Modified: 03/07/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society