- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- A robust linear program solver for projectahedra
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
A robust linear program solver for projectahedra Laza, Marius
Abstract
Linear programming has a wide range of applications, optimization-related problems being one of them. Important concerns in linear programming are efficiency, robustness, and accuracy. Linear programming is used in a reachability analysis tool called Coho [GM99] for dynamical systems. Previous experience has shown that linear programs in this tool lead to highly ill-conditioned linear systems which prevented successful reachability analysis. This thesis presents a robust linear program solver with provable error bounds that exploits the special structure of the linear programs that result in the reachability tool. This contribution is of interest for the particular application for which it was developed. Furthermore, it shows how duality and combinatorial aspects of linear programming can be exploited to achieve greater efficiency, robustness, and accuracy.
Item Metadata
Title |
A robust linear program solver for projectahedra
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2002
|
Description |
Linear programming has a wide range of applications, optimization-related problems
being one of them. Important concerns in linear programming are efficiency,
robustness, and accuracy. Linear programming is used in a reachability analysis
tool called Coho [GM99] for dynamical systems. Previous experience has shown
that linear programs in this tool lead to highly ill-conditioned linear systems which
prevented successful reachability analysis. This thesis presents a robust linear program
solver with provable error bounds that exploits the special structure of the
linear programs that result in the reachability tool. This contribution is of interest
for the particular application for which it was developed. Furthermore, it shows
how duality and combinatorial aspects of linear programming can be exploited to
achieve greater efficiency, robustness, and accuracy.
|
Extent |
3913399 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-08-13
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0051539
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2002-05
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.