Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1023/A:1020351410169 | Journal of Global Optimization |
Keywords | Field | DocType |
Mixed integer programming,Convex programming,Semidefinite programming,Mixed integer nonlinear programming,Mixed integer convex programming | Second-order cone programming,Discrete mathematics,Mathematical optimization,Convex combination,Subderivative,Convex polytope,Proper convex function,Conic optimization,Convex optimization,Mathematics,Convex analysis | Journal |
Volume | Issue | ISSN |
24 | 3 | 1573-2916 |
Citations | PageRank | References |
6 | 0.57 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert A. Stubbs | 1 | 109 | 9.61 |
| Sanjay Mehrotra | 2 | 521 | 77.18 |