| Article ID: | iaor20023031 |
| Country: | Netherlands |
| Volume: | 29 |
| Issue: | 4 |
| Start Page Number: | 181 |
| End Page Number: | 186 |
| Publication Date: | Nov 2001 |
| Journal: | Operations Research Letters |
| Authors: | Tunel Levent |
We prove that all results determining the dimension and the affine hull of feasible solutions of any combinatorial optimization problem, and various more general nonconvex optimization problems, directly imply the existence of the Slater points for a very wide class of semidefinite programming relaxations of these nonconvex problems. Our proofs are very concise, constructive and elementary.