Improved Balas and Mazzola Linearization for Quadratic 0-1 Programs with Application in a New Cutting Plane Algorithm

TL;DR

This paper enhances the Balas and Mazzola linearization method for quadratic 0-1 programs by strengthening its primal and dual formulations and introduces a novel cutting plane algorithm to improve solution efficiency.

Contribution

It presents a strengthened primal and dual formulation of BML and proposes a new cutting plane algorithm for quadratic 0-1 programming.

Findings

Improved linearization leads to tighter relaxations.

New cutting plane algorithm enhances solution speed.

Potential for better optimization of quadratic 0-1 problems.

Abstract

Balas and Mazzola linearization (BML) is widely used in devising cutting plane algorithms for quadratic 0-1 programs. In this article, we improve BML by first strengthening the primal formulation of BML and then considering the dual formulation. Additionally, a new cutting plane algorithm is proposed.