<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T02:02:40Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/19784" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/19784</identifier><datestamp>2026-09-24T01:52:01Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Siddall, J.N.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Natesan, M.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Mechanical Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-07-08T15:34:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-07-08T15:34:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">1973-03</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/19784</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/24715</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Title: Pseudo-Boolean Programming for Bivalent Optimization, Author: M. Natesan, Location: Thode</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">&lt;p>This thesis introduces an effective computational algorithm making&#xd;
use of Boolean algebra for solving bivalent optimization problems with&#xd;
linear and nonlinear constraints. This method is a combination of the&#xd;
algorithm suggested by Hammer and the branch and bound method. The whole&#xd;
system of constraints is replaced by a single Boolean resolvent function&#xd;
and the solutions of this resolvent are found by branch and bound method&#xd;
which are found to be the feasible solutions of the system of constraints.&#xd;
Some practical applications are also discussed.&lt;/p></dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Engineering (ME)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Pseudo-Boolean Programming for Bivalent Optimization</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>