Date of Award

1999

Degree Type

Thesis

Degree Name

M.Sc.

Department

Mathematics and Statistics

First Advisor

Caron, R.

Keywords

Mathematics.

Rights

CC BY-NC-ND 4.0

Abstract

In this thesis we present Boneh's Set Covering (SC) approach to the redundancy detection problem, and we show that his approach is also applicable to the related problem of finding a Prime Representation (PR), an Irreducible Infeasible System (IIS) or a Minimal Infeasible System (MIS). In order to generate the SC matrix E, we need a probabilistic method for sampling points in Rn. Consequently we can assign a detection probability to each row of E, and we show that if a row of E has a zero detection probability, then it must correspond to what we call a local quasi-minimizer We show that convex systems have no such local quasi-minimizers.Dept. of Economics, Mathematics, and Statistics. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1999 .F46. Source: Masters Abstracts International, Volume: 39-02, page: 0516. Adviser: Richard J. Caron. Thesis (M.Sc.)--University of Windsor (Canada), 1999.

Share

COinS