### Abstract

The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially sized) linear program.

Original language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Operations research |

Number of pages | 12 |

Volume | 2005-24 |

Publication status | Published - 2005 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2005-24 |

### Keywords

- linear programming
- standard quadratic optimization
- positive polynomials

## Fingerprint Dive into the research topics of 'A Linear Programming Reformulation of the Standard Quadratic Optimization Problem'. Together they form a unique fingerprint.

## Cite this

de Klerk, E., & Pasechnik, D. V. (2005).

*A Linear Programming Reformulation of the Standard Quadratic Optimization Problem*. (CentER Discussion Paper; Vol. 2005-24). Operations research.