Facets of a mixed-integer bilinear covering set with bounds on variables

Journal of Global Optimization(2019)

引用 9|浏览7
暂无评分
摘要
We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a certain way. This description does not introduce any new variables, but consists of exponentially many inequalities. An extended formulation with a few extra variables and much smaller number of constraints is presented. We also derive a linear time separation algorithm for finding the facet defining inequalities of this convex hull. We study the effectiveness of the new inequalities and the extended formulation using some examples.
更多
查看译文
关键词
Bilinear constraints, Mixed-integer programming, Separation, Global optimization, Cutting-stock problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要