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

被引:5
|
作者
Rahman, Hamidur [1 ]
Mahajan, Ashutosh [1 ]
机构
[1] Indian Inst Technol, Ind Engn & Operat Res, Mumbai 400076, Maharashtra, India
关键词
Bilinear constraints; Mixed-integer programming; Separation; Global optimization; Cutting-stock problem;
D O I
10.1007/s10898-019-00783-0
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:417 / 442
页数:26
相关论文
共 50 条