Abstract
Investigations are described by means of which any nonlinear restriction of a 0-1-programming problem can be replaced by a nearly minimal mumber of linear restrictions; thereby the set of all admissible points is not changed. The inbestigations are established by means of results in [4] and the threshold logic.