The behavior of enumeration-based programs for solving MINLPs depends at least in part on the quality of the bounds on the optimal value and of the feasible solutions found. We consider MINLP problems with linear constraints. The convex hull relaxation (CHR) is a special case of the primal relaxation (Guignard 1994, 2007) that is very simple to implement. In the convex case, it provides a bound stronger than the continuous relaxation bound, and in all cases it provides good, and often optimal, feasible solutions. We present computational results for QAP, GQAP, MSAP and CDAP instances.
Citation
Department of OPIM Researh Report, Oct. 2010, the Wharton School, University of Pennsylvania
Article
View CONVEX HULL RELAXATION (CHR) FOR CONVEX AND NONCONVEX MINLP PROBLEMS WITH LINEAR CONSTRAINTS