Generating Convex Polynomial Inequalities for Mixed 0–1 Programs

被引：0
|
作者：
Robert A. Stubbs
Sanjay Mehrotra
机构：
[1] Northwestern University,Department of Industrial Engineering and Management Sciences
来源：
Journal of Global Optimization | 2002年 / 24卷
关键词：
Mixed integer programming; Convex programming; Semidefinite programming; Mixed integer nonlinear programming; Mixed integer convex programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We develop a method for generating valid convex quadratic inequalities for mixed0–1 convex programs. We also show how these inequalities can be generated in the linear case by defining cut generation problems using a projection cone. The basic results for quadratic inequalities are extended to generate convex polynomial inequalities.
引用
收藏
页码：311 / 332
页数：21
相关论文
共 50 条
  • [1] Generating convex polynomial inequalities for mixed 0-1 programs
    Stubbs, RA
    Mehrotra, S
    JOURNAL OF GLOBAL OPTIMIZATION, 2002, 24 (03) : 311 - 332
  • [2] VALID INEQUALITIES FOR MIXED 0-1 PROGRAMS
    VANROY, TJ
    WOLSEY, LA
    DISCRETE APPLIED MATHEMATICS, 1986, 14 (02) : 199 - 213
  • [3] A linearization method for mixed 0-1 polynomial programs
    Chang, CT
    Chang, CC
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (10) : 1005 - 1016
  • [4] Perspective cuts for a class of convex 0–1 mixed integer programs
    A. Frangioni
    C. Gentile
    Mathematical Programming, 2006, 106 : 225 - 236
  • [5] Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
    Sourour Elloumi
    Amélie Lambert
    Arnaud Lazare
    Journal of Global Optimization, 2021, 80 : 231 - 248
  • [6] Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
    Elloumi, Sourour
    Lambert, Amelie
    Lazare, Arnaud
    JOURNAL OF GLOBAL OPTIMIZATION, 2021, 80 (02) : 231 - 248
  • [7] Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
    Fomeni, Franklin Djeumou
    Kaparis, Konstantinos
    Letchford, Adam N.
    MATHEMATICAL PROGRAMMING, 2015, 151 (02) : 639 - 658
  • [8] Perspective cuts for a class of convex 0-1 mixed integer programs
    Frangioni, A
    Gentile, C
    MATHEMATICAL PROGRAMMING, 2006, 106 (02) : 225 - 236
  • [9] Lifted flow cover inequalities for mixed 0-1 integer programs
    Gu, ZH
    Nemhauser, GL
    Savelsbergh, MWP
    MATHEMATICAL PROGRAMMING, 1999, 85 (03) : 439 - 467
  • [10] Lifted flow cover inequalities for mixed 0-1 integer programs
    Zonghao Gu
    George L. Nemhauser
    Martin W.P. Savelsbergh
    Mathematical Programming, 1999, 85 : 439 - 467
12345