Generating convex polynomial inequalities for mixed 0-1 programs

R. Stubbs; S. Mehrotra

doi:10.1023/A:1020351410169

Generating convex polynomial inequalities for mixed 0-1 programs

R. Stubbs, S. Mehrotra

Industrial Engineering and Management Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	311-332
Journal	Journal of Global Optimization
Volume	24
DOIs	https://doi.org/10.1023/A:1020351410169
State	Published - 2002

Access to Document

10.1023/A:1020351410169

http://www.springerl

Cite this

@article{59dafe95d59f4d069a4c4cd9a9efc809,

title = "Generating convex polynomial inequalities for mixed 0-1 programs",

abstract = "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.",

author = "R. Stubbs and S. Mehrotra",

year = "2002",

doi = "10.1023/A:1020351410169",

language = "English",

volume = "24",

pages = "311--332",

journal = "Journal of Global Optimization",

issn = "0925-5001",

publisher = "Springer International Publishing AG",

}

TY - JOUR

T1 - Generating convex polynomial inequalities for mixed 0-1 programs

AU - Stubbs, R.

AU - Mehrotra, S.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

U2 - 10.1023/A:1020351410169

DO - 10.1023/A:1020351410169

M3 - Article

SN - 0925-5001

VL - 24

SP - 311

EP - 332

JO - Journal of Global Optimization

JF - Journal of Global Optimization

ER -

Generating convex polynomial inequalities for mixed 0-1 programs

Abstract

Access to Document

Fingerprint

Cite this