Pawoumodom Takouda (Laurentian University)

Can semidefinite programming lay it out?
Wednesday 6 Nov 2019 at 3.10pm, JCMB 5327

Abstract

The unequal-area facility layout problem is a hard optimization problem consists in partitioning a rectangular facility of known dimensions into departments, which have pre-specified but possibly unequal areas. Additional constraints include ensuring that the departments do not overlap and that they respect prescribed aspect ratios. The objective is to minimize the total cost associated with the known (or projected) interactions between the departments. Instances of this problem arise in management and engineering. We present recent developments regarding the applications of conic optimization methodologies, namely semidefinite programming, to build a mixed integer semidefinite programming model where the area constraints are formulated as semidefinite constraints, the Manhattan distances are linearized and the disjunctive non-overlapping constraints are modelled using only two binary variables per pair of departments.

Seminars by year

Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996