A simple recipe for concise mixed 0-1 linearizations

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.