A multi-term, polyhedral relaxation of a 0–1 multilinear function for Boolean logical pattern generation
- 76 Downloads
0–1 multilinear program (MP) holds a unifying theory to LAD pattern generation. This paper studies a multi-term relaxation of the objective function of the pattern generation MP for a tight polyhedral relaxation in terms of a small number of stronger 0–1 linear inequalities. Toward this goal, we analyze data in a graph to discover useful neighborhood properties among a set of objective terms around a single constraint term. In brief, they yield a set of facet-defining inequalities for the 0–1 multilinear polytope associated with the McCormick inequalities that they replace. The construction and practical utility of the new inequalities are illustrated on a small example and thoroughly demonstrated through numerical experiments with 12 public machine learning datasets.
KeywordsLogical analysis of data Pattern 0–1 multilinear programming Multi-term polyhedral relaxation Facet-defining inequalities Graph Star
- 17.Granot, F., Hammer, P.: On the use of boolean functions in 0–1 programming. Methods Oper. Res. 12, 154–184 (1971)Google Scholar
- 19.IBM Corp.: IBM ILOG CPLEX Optimization Studio CPLEX User’s Manual Version 12 Release 8 (2017). https://www.ibm.com/support/knowledgecenter/SSSA5P_12.8.0/ilog.odms.studio.help/pdf/usrcplex.pdf. Accessed 22 Jun 2018
- 24.Lichman, M.: UCI machine learning repository (2013). http://archive.ics.uci.edu/ml. Accessed 22 Jun 2018
- 25.Nguyen, T.T., Tawarmalani, M, Richard, J.-P.P.: Convexification techniques for linear complementarity constraints. In: 15th Conference on Integer Programming and Combinatorial Optimization (2011)Google Scholar