RESEARCH COMMONS
LIBRARY

Constraint Optimal Selection Techniques (costs) For Linear Programming

ResearchCommons/Manakin Repository

Constraint Optimal Selection Techniques (costs) For Linear Programming

Show full item record

Title: Constraint Optimal Selection Techniques (costs) For Linear Programming
Author: Saito, Goh
Abstract: Simplex pivoting algorithms remain the dominant approach to solve linear programming (LP) because they have advantages over interior-point methods. However, current simplex algorithms are often inadequate for solving a large-scale LPs because of their insufficient computational speeds. This dissertation develops the significantly faster simplex-based, active-set approaches called Constraint Optimal Selection Techniques (COSTs). COSTs specify a constraint-ordering rule based on constraints' likelihood of being binding at optimality, as well as a rule for adding constraints. In particular, new techniques for adding multiple constraints in an active-set framework, and an efficient constraint-ordering rule for LP are proposed. These innovations greatly reduce computation time to solve LP problems.
URI: http://hdl.handle.net/10106/11066
Date: 2012-07-25

Files in this item

Files Size Format View
Saito_uta_2502D_11637.pdf 2.287Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Browse

My Account

Statistics

About Us