<?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-21T01:28:59Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/27062" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/27062</identifier><datestamp>2025-11-19T20:59:18Z</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">Deza, Antoine</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Franek, Frantisek</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Guan, Zhongyan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-10-14T14:59:24Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-10-14T14:59:24Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/27062</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Linear optimization is concerned with maximizing, or minimizing, a linear objective&#xd;
function over a feasible region defined as the intersection of a finite number&#xd;
of hyperplanes. Pivot-based simplex methods and central-path following interior&#xd;
point methods are the computationally most efficient algorithms to solve linear&#xd;
optimization instances. Discrete optimization further assumes that some of the&#xd;
variables are integer-valued. This dissertation focuses on the geometric properties&#xd;
of the feasible region under some structural assumptions. In the first part, we consider&#xd;
lattice (d,k)-polytopes; that is, the convex hull of a set of points drawn from&#xd;
{0,1,...,k}^d, and study the largest possible diameter, delta(d,k), that a lattice (d,k)-&#xd;
polytope can achieve. We present novel properties and an enumeration algorithm&#xd;
to determine previously unknown values of delta(d,k). In particular, we determine&#xd;
the values for delta(3,6) and delta(5,3), and enumerate all the lattice (3,3)-polytopes&#xd;
achieving delta(3,3). In the second part, we consider the convex hull of all the 2^(2^d - 1)&#xd;
subsums of the 2^d - 1 nonzero {0,1}-valued vectors of length d, and denote by&#xd;
a(d) the number of its vertices. The value of a(d) has been determined until d =8&#xd;
as well as asymptotically tight lower and upper bounds for loga(d). This convex&#xd;
hull forms a so-called primitive zonotope that is dual to the resonance hyperplane&#xd;
arrangement and belongs to a family that is conjectured to include lattice polytopes&#xd;
achieving the largest possible diameter over all lattice (d,k)-polytopes. We&#xd;
propose an algorithm exploiting the combinatorial and geometric properties of the&#xd;
input and present preliminary computational results.</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">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Linear Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Lattice Polytopes</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Diameter of Polytopes</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Primitive Zonotopes</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Computational and Geometric Aspects of Linear 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>