arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2001.00514math.OCcs.DM
收藏

Piecewise Polyhedral Formulations for a Multilinear Term

Kaarthik Sundar, Harsha Nagarajan, Jeff Linderoth, Site Wang, Russell Bent

英文摘要:

In this paper, we present a mixed-integer linear programming (MILP) formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using its convex hull representation. Based on the solution of the PPR, we also present a MILP formulation whose solutions are feasible for nonconvex, multilinear equations. We then present computational results showing the effectiveness of proposed formulations on instances of standard benchmarks of nonlinear programs (NLPs) with multilinear terms and compare the proposed formulation with a traditional formulation that is built by recursively relaxing bilinear groupings of multilinear terms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑