Convex cones, polyhedral sets and polytopes applied to linear systems and linear programming

Author

Donna Creel Stein

Date of Award

5-1998

Degree Type

Thesis

Degree Name

Master of Science

Major

Mathematics

Major Professor

Yueh-Er Kuo

Committee Members

Hinton, Thistlethwaite

Abstract

This study, explores the subject of convex cones, polyhedral sets, polytopes and their relationship to linear systems and linear programming. This paper begins with the theory of convex sets. At this point necessary definitions, examples, and theorems of convexity are stated. These theorems and definitions are then used to introduce various classes of convex cones and their application to linear systems. Specifically, polyhedral cones are discussed in depth. These preliminary results are then applied to polyhedral sets and polytopes and their application to linear programming.

Recommended Citation

Stein, Donna Creel, "Convex cones, polyhedral sets and polytopes applied to linear systems and linear programming. " Master's Thesis, University of Tennessee, 1998.
https://trace.tennessee.edu/utk_gradthes/10382