Title:
Topics in exact precision mathematical programming

Thumbnail Image
Author(s)
Steffy, Daniel E.
Authors
Advisor(s)
Cook, William J.
Advisor(s)
Editor(s)
Associated Organization(s)
Series
Supplementary to
Abstract
The focus of this dissertation is the advancement of theory and computation related to exact precision mathematical programming. Optimization software based on floating-point arithmetic can return suboptimal or incorrect resulting because of round-off errors or the use of numerical tolerances. Exact or correct results are necessary for some applications. Implementing software entirely in rational arithmetic can be prohibitively slow. A viable alternative is the use of hybrid methods that use fast numerical computation to obtain approximate results that are then verified or corrected with safe or exact computation. We study fast methods for sparse exact rational linear algebra, which arises as a bottleneck when solving linear programming problems exactly. Output sensitive methods for exact linear algebra are studied. Finally, a new method for computing valid linear programming bounds is introduced and proven effective as a subroutine for solving mixed-integer linear programming problems exactly. Extensive computational results are presented for each topic.
Sponsor
Date Issued
2011-01-24
Extent
Resource Type
Text
Resource Subtype
Dissertation
Rights Statement
Rights URI