| Article ID: | iaor2005740 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 1 |
| Start Page Number: | 55 |
| End Page Number: | 61 |
| Publication Date: | Jan 2005 |
| Journal: | Operations Research Letters |
| Authors: | Adams Warren P., Forrester Richard J. |
| Keywords: | linearization |
A new linearization method for mixed 0–1 polynomial programs is obtained by repeatedly applying a classical strategy introduced almost 30 years ago. Two important contributions are: the most concise known linear representations of cubic and higher-degree problems, and a simple argument for explaining and extending two alternate linearizations.