Abstract
dc:description.abstract<p>This thesis proposes a new mixed integer programming model of the two group classification problem. A branch-and-bound procedure is designed to solve the mixed integer programming model. The proposed procedure is more efficient than recently published procedures in the literature. Three heuristics are also designed from the branch-and- bound procedure. The Three Seed and N Seed heuristics provide solutions that are "close" to the optimal solution for substantially less computational effort. This thesis also proposes a quadratic transformation method which provides a solution that is competitive with the classical quadratic discriminant analysis method.</p>
Degree
thesis:*- Department dc:contributor.department
- Business Administration
- Year dc:date.issued
- 1991
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Banks, James William
- Advisor dc:contributor.advisor
-
- Abad, Prakash L.
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Identifier URI
- https://doi.org/10.71548/14831
- Dc Identifier Other
-
opendissertations/3603
4620
1668344