Constraint Optimal Selection Techniques (COSTs) for nonnegative linear programming problems

G. Saito, H.W. Corley, Jay M. Rosenberger, Tai-Kuan Sung and Alireza Noroziroshan

Applied Mathematics and Computation, 2015, vol. 251, issue C, 586-598

Abstract: We describe an active-set, cutting-plane approach called Constraint Optimal Selection Techniques (COSTs) and develop an efficient new COST for solving nonnegative linear programming problems. We give a geometric interpretation of the new selection rule and provide computational comparisons of the new COST with existing linear programming algorithms for some large-scale sample problems.

Keywords: Linear programming; Large-scale linear programming; Cutting planes; Active-set methods; Constraint selection (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314016129
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:251:y:2015:i:c:p:586-598

DOI: 10.1016/j.amc.2014.11.080

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().