Back to search

McMaster University

New solution algorithms for the classification problem

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 × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/3603
4620
1668344

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Banks, James William. New solution algorithms for the classification problem. 1991. http://hdl.handle.net/11375/8396