Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
type: Item
instance of: scholarly article
title: Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
zbMATH Open document ID: 1328.90082
author: G. Saito
author: H. W. Corley
author: Jay M. Rosenberger
author: Tai-Kuan Sung
author: Alireza Noroziroshan
published in: Applied Mathematics and Computation
publication date: 2016-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6526131
zbMATH Keywords: linear programming
zbMATH Keywords: large-scale linear programming
zbMATH Keywords: cutting planes
zbMATH Keywords: active-set methods
zbMATH Keywords: constraint selection
describes a project that uses: rMPC
describes a project that uses: MarPlex
MaRDI profile type: Publication
full work available at URL: j.amc.2014.11.080
OpenAlex ID: W2012935950
cites work: Q3160276
cites work: The many facets of linear programming
cites work: GPS network design: logistics solution using optimal and near-optimal methods.
cites work: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
cites work: A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only
cites work: An external reconstruction approach (ERA) to linear programming
cites work: A constraint selection technique for a class of linear programs
cites work: A primal-dual simplex method for linear programs
cites work: Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
cites work: Computational Experience with an Interior Point Cutting Plane Algorithm
cites work: Linear operator theory in engineering and science. Repr. of the 1971 orig., publ. by Holt, Rinehart \& Winston, Inc.
cites work: Practical finite pivoting rules for the simplex method
cites work: A simplex-like method with bisection for linear programming1
cites work: An improved initial basis for the simplex algorithm
cites work: A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
cites work: Artificial-free simplex algorithm based on the non-acute constraint relaxation
DOI: 10.1016/J.AMC.2014.11.080
description: scientific article; zbMATH DE number 6526131