Please use this identifier to cite or link to this item:
|Title:||Pseudo-Boolean Programming for Bivalent Optimization|
|Abstract:||<p>This thesis introduces an effective computational algorithm making use of Boolean algebra for solving bivalent optimization problems with linear and nonlinear constraints. This method is a combination of the algorithm suggested by Hammer and the branch and bound method. The whole system of constraints is replaced by a single Boolean resolvent function and the solutions of this resolvent are found by branch and bound method which are found to be the feasible solutions of the system of constraints. Some practical applications are also discussed.</p>|
|Description:||Title: Pseudo-Boolean Programming for Bivalent Optimization, Author: M. Natesan, Location: Thode|
|Appears in Collections:||Open Access Dissertations and Theses|
Files in This Item:
|Natesan_M_1973_03_master.pdf||Title: Pseudo-Boolean Programming for Bivalent Optimization, Author: M. Natesan, Location: Thode||15.17 MB||Adobe PDF||View/Open|
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.