A disjunctive cutting plane procedure for general mixed-integer linear programs

被引：0
|
作者：
Jonathan H. Owen
Sanjay Mehrotra
机构：
[1] GM R&D Center,
[2] Mail Code 480-106-359,undefined
[3] 30500 Mound Road,undefined
[4] Warren,undefined
[5] MI 48090-9055,undefined
[6] USA,undefined
[7] e-mail: jonathan.owen@gm.com,undefined
[8] Department of Industrial Engineering and Management Sciences,undefined
[9] Robert R. McCormick School of Engineering,undefined
[10] Northwestern University,undefined
[11] Evanston,undefined
[12] Illinois 60208,undefined
[13] USA,undefined
[14] e-mail: mehrotra@iems.nwu.edu,undefined
来源：
Mathematical Programming | 2001年 / 89卷
关键词：
Key words: mixed integer programming; Mathematics Subject Classification (1991): 90C10, 90C11;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we develop a cutting plane algorithm for solving mixed-integer linear programs with general-integer variables. A novel feature of the algorithm is that it generates inequalities at all γ-optimal vertices of the LP-relaxation at each iteration. The cutting planes generated in the procedure are found by considering a natural generalization of the 0-1 disjunction used by Balas, Ceria, and Cornuéjols in the context of solving binary mixed-integer linear programs [3, 4].
引用
收藏
页码：437 / 448
页数：11
相关论文
共 50 条
  • [41] Cutting planes for mixed-integer knapsack polyhedra
    Xiao-Qing Yan
    E. Andrew Boyd
    Mathematical Programming, 1998, 81 : 257 - 262
  • [42] Cutting planes for mixed-integer knapsack polyhedra
    Yan, Xiao-Qing
    Boyd, E. Andrew
    Mathematical Programming, Series B, 1998, 81 (02): : 257 - 262
  • [43] A Mixed-Integer Linear Programming Model for the Cutting Stock Problem in the Steel Industry
    Morillo-Torres, Daniel
    Torres Baena, Mauricio
    Wilmer Escobar, John
    Romero-Conrado, Alfonso R.
    Coronado-Hernandez, Jairo R.
    Gatica, Gustavo
    APPLIED COMPUTER SCIENCES IN ENGINEERING, WEA 2021, 2021, 1431 : 315 - 326
  • [44] Performance Analysis of Mixed-Integer Conic and Mixed-Integer Linear Unit Commitment Models
    Savasci, Alper
    Inaolaji, Adedoyin
    Paudyal, Sumit
    2020 IEEE POWER & ENERGY SOCIETY GENERAL MEETING (PESGM), 2020,
  • [45] INTEGER AND MIXED-INTEGER PROGRAMMING MODELS - GENERAL PROPERTIES
    MEYER, RR
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1975, 16 (3-4) : 191 - 206
  • [46] Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
    Trespalacios, Francisco
    Grossmann, Ignacio E.
    INFORMS JOURNAL ON COMPUTING, 2016, 28 (02) : 209 - 222
  • [47] A CUTTING-PLANE GAME FOR FACIAL DISJUNCTIVE PROGRAMS
    JEROSLOW, RG
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1980, 18 (03) : 264 - 281
  • [48] An online proof-producing decision procedure for mixed-integer linear arithmetic
    Berezin, S
    Ganesh, V
    Dill, DL
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2003, 2619 : 521 - 536
  • [49] A hierarchy of bounds for stochastic mixed-integer programs
    Burhaneddin Sandıkçı
    Nan Kong
    Andrew J. Schaefer
    Mathematical Programming, 2013, 138 : 253 - 272
  • [50] A STRONG DUAL FOR CONIC MIXED-INTEGER PROGRAMS
    Moran R, Diego A.
    Dey, Santanu S.
    Vielma, Juan Pablo
    SIAM JOURNAL ON OPTIMIZATION, 2012, 22 (03) : 1136 - 1150
12345