The aim of the present lecture is to propose a method for bivalent (0,1) linear and nonlinear programming. We define a pseudo-Boolean function as a real-valued function with bivalent arguments. An equation (inequality) whose members are pseudo-Boolean functions is named pseudo- Boolean. In this lecture procedures will be proposed for : l) solving systems of linear pseudo-Boolean equations and inequalities; 2)solving systems of nonlinear pseudo-Boolean equations and inequalities; 3) minimizing a pseudo- Boolean function with or without constraints.
Read more at http://ebookee.org/Pseudo-Boolean-methods-for-bivalent-programming-Lecture-notes-in-mathematics-by-P-L-Hammer-Repost_1189183.html#zVBiwhMBMMDDTh3U.99