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 条
  • [1] Facets of a mixed-integer bilinear covering set with bounds on variables
    Hamidur Rahman
    Ashutosh Mahajan
    Journal of Global Optimization, 2019, 74 : 417 - 442
  • [2] On the facet defining inequalities of the mixed-integer bilinear covering set
    Hamidur Rahman
    Ashutosh Mahajan
    Mathematical Methods of Operations Research, 2020, 92 : 545 - 575
  • [3] On the facet defining inequalities of the mixed-integer bilinear covering set
    Rahman, Hamidur
    Mahajan, Ashutosh
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2020, 92 (03) : 545 - 575
  • [4] Lifted inequalities for mixed-integer bilinear covering sets
    Chung, Kwanghun
    Richard, Jean-Philippe P.
    Tawarmalani, Mohit
    MATHEMATICAL PROGRAMMING, 2014, 145 (1-2) : 403 - 450
  • [5] On the facets of the mixed-integer knapsack polyhedron
    Atamtürk, A
    MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) : 145 - 175
  • [6] Mixed-integer bilinear programming problems
    Adams, Warren P.
    Sherali, Hanif D.
    Mathematical Programming, Series A, 1993, 59 (03): : 279 - 305
  • [7] Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
    Schade, Jamico
    Sinha, Makrand
    Weltge, Stefan
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2024, 2024, 14679 : 379 - 392
  • [8] Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
    Schade, Jamico
    Sinha, Makrand
    Weltge, Stefan
    arXiv, 2023,
  • [9] On mixed-integer sets with two integer variables
    Dash, Sanjeeb
    Dey, Santanu S.
    Guenluek, Oktay
    OPERATIONS RESEARCH LETTERS, 2011, 39 (05) : 305 - 309
  • [10] A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
    Hemmati, Mehdi
    Smith, J. Cole
    DISCRETE OPTIMIZATION, 2016, 20 : 105 - 134