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

DOI10.1016/J.AMC.2014.11.080zbMATH Open1328.90082OpenAlexW2012935950MaRDI QIDQ903045FDOQ903045

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

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

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

Recommendations

• A constraint selection technique for a class of linear programs
• A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
• Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
• A steepest edge active set algorithm for solving sparse linear programming problems
• A Sequential Linear Constraint Programming Algorithm for NLP

Cites work

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

Cited in

(4)

• Integer linear programming approaches for non-unique probe selection
• Technical Note—On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients
• A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
• A constraint selection technique for a class of linear programs

Describes a project that uses

Uses Software

• rMPC
• MarPlex

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903045)