MOPS -- Mathematical optimization system
type: Item
instance of: scholarly article
title: MOPS -- Mathematical optimization system
zbMATH Open document ID: 0800.90690
DOI: 10.1016/0377-2217(94)90312-3
author: Uwe H. Suhl
published in: European Journal of Operational Research
publication date: 1994-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 527596
describes a project that uses: DEVEX
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90312-3
OpenAlex ID: W1983931962
cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Q4177319
cites work: Q3740904
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
cites work: Solving staircase linear programs by the simplex method, 1: Inversion
cites work: A practicable steepest-edge simplex algorithm
cites work: Pivot selection methods of the Devex LP code
cites work: A general phase-I method in linear programming
cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
cites work: Finding duplicate rows in a linear programming model
cites work: Q4132007
cites work: The Composite Simplex Algorithm
cites work: Q4101755
description: scientific article; zbMATH DE number 527596