Back to search

McMaster University

Pseudo-Boolean Programming for Bivalent Optimization

Abstract

dc:description.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>

Degree

thesis:*
Department dc:contributor.department
Mechanical Engineering
Year dc:date.issued
1973

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Natesan, M.
Advisor dc:contributor.advisor
  • Siddall, J.N.

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Natesan, M.. Pseudo-Boolean Programming for Bivalent Optimization. 1973. http://hdl.handle.net/11375/19784