Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems

Abstract

This paper gives rules that enable the transformation of a 0-1 polynomial programming problem into a 0-1 linear programming problem to be effected with reduced numbers of constraints. Rules are also given that provide reduced numbers of variables when the true variables of interest are not individual cross-product terms, but sums of such terms or polynomials of the form (∑x j ) p .