Constraint Optimal Selection Techniques (COSTs) For A Class Of Linear Programming Problems

Author

Tai-Kuan Sung

Graduation Semester and Year

2021

Language

English

Document Type

Dissertation

Degree Name

Doctor of Philosophy in Industrial Engineering

Department

Industrial and Manufacturing Systems Engineering

First Advisor

Herbert W Corley

Abstract

This dissertation describes two classes of Constraint Optimal Selection Techniques (COSTs). An algorithm of each type is developed for solving nonnegative linear programming problems. In addition, geometric interpretations of these new algorithms are given, computational results for some large-scale problems are provided, and directions for future research are discussed.

Disciplines

Engineering | Operations Research, Systems Engineering and Industrial Engineering

License

This work is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 4.0 International License.

Comments

Degree granted by The University of Texas at Arlington

Recommended Citation

Sung, Tai-Kuan, "Constraint Optimal Selection Techniques (COSTs) For A Class Of Linear Programming Problems" (2021). Industrial, Manufacturing, and Systems Engineering Dissertations. 65.
https://mavmatrix.uta.edu/industrialmanusys_dissertations/65