Academic Journals Database
Disseminating quality controlled scientific knowledge

Constraint Optimal Selection Techniques (COSTs) for Li-near Programming

ADD TO MY LIST
 
Journal: American Journal of Operations Research
ISSN 2160-8830

Volume: 03;
Issue: 01;
Start page: 53;
Date: 2013;
Original page

Keywords: Linear Programming | Large-Scale Linear Programming | Cutting Planes | Active-Set Methods | Constraint Selection | COSTs

ABSTRACT
We describe a new active-set, cutting-plane Constraint Optimal Selection Technique (COST) for solving general linear programming problems. We describe strategies to bound the initial problem and simultaneously add multiple constraints. We give an interpretation of the new COST’s selection rule, which considers both the depth of constraints as well as their angles from the objective function. We provide computational comparisons of the COST with existing linear programming algorithms, including other COSTs in the literature, for some large-scale problems. Finally, we discuss conclusions and future research.
Affiliate Program     

Tango Rapperswil
Tango Rapperswil