Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems

DOI10.1016/j.amc.2014.11.080zbMath1328.90082OpenAlexW2012935950MaRDI QIDQ903045

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

Publication date: 4 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.11.080

zbMATH Keywords

linear programmingcutting planesactive-set methodsconstraint selectionlarge-scale linear programming

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Uses Software

• rMPC
• MarPlex

Cites Work

• Unnamed Item
• A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
• Artificial-free simplex algorithm based on the non-acute constraint relaxation
• A primal-dual simplex method for linear programs
• Practical finite pivoting rules for the simplex method
• An external reconstruction approach (ERA) to linear programming
• A constraint selection technique for a class of linear programs
• Linear operator theory in engineering and science. Repr. of the 1971 orig., publ. by Holt, Rinehart \& Winston, Inc.
• The many facets of linear programming
• GPS network design: logistics solution using optimal and near-optimal methods.
• An improved initial basis for the simplex algorithm
• A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
• A simplex-like method with bisection for linear programming¹
• Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
• Computational Experience with an Interior Point Cutting Plane Algorithm
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems

This page was built for publication: Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems