<?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-22T13:14:40Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3189" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3189</identifier><datestamp>2017-03-21T15:54:41Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9910</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="dd197d26-3594-47b6-87ac-14700c28823e" confidence="600">Dang, Jiarui</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-08-29T14:31:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-08-29T14:31:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-08-29T14:31:46Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3189</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis aims to study the theoretical complexity and empirical performance of decomposition algorithms.  We focus on linear programs with a block-angular structure.  Decomposition algorithms used to be the only way to solve large-scale special structured problems, in terms of memory limit and CPU time.  However, with the advances in computer technology over the past few decades, many large-scale problems can now be solved simply by using some general purpose LP software, without exploiting the problems&amp;apos; inner structures.  A question arises naturally, should we solve a structured problem with decomposition, or directly solve it as a whole?  We try to understand how a problem&amp;apos;s characteristics influence its computational performance, and compare the relative efficiency of algorithms with and without decomposition.  Two comparisons are conducted in our research: first, the Dantzig-Wolfe decomposition method (DW) versus the simplex method (simplex); second, the analytic center cutting plane method (ACCPM) versus the interior point method (IPM).  These comparisons fall into the two main solution approaches in linear programming: simplex-based algorithms and IPM-based algorithms.  Motivated by our observations of ACCPM and DW decomposition, we devise a hybrid algorithm combining ACCPM and DW, which are the counterparts of IPM and simplex in the decomposition framework, to take the advantages of both: the quick convergence rate of IPM-based methods, as well as the accuracy of simplex-based algorithms.  A large set of 316 instances is incorporated in our experiments, so that different dimensioned problems with primal or dual block-angular structures are covered to test our conclusions.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">empirical analysis</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">block-angular</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Dantzig-Wolfe decomposition</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">analytic center cutting plane method</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">interior point method</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">simplex</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Accounting</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Empirical Analysis of Algorithms for Block-Angular Linear Programs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Management Sciences</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>