Generating convex polynomial inequalities for mixed 0-1 programs

R. Stubbs, S. Mehrotra

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)311-332
JournalJournal of Global Optimization
StatePublished - 2002


Dive into the research topics of 'Generating convex polynomial inequalities for mixed 0-1 programs'. Together they form a unique fingerprint.

Cite this