Constraint Optimal Selection Techniques (COSTs) For A Class Of Linear Programming Problems
MetadataShow full item record
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.