MOPS -- Mathematical optimization system (Q1317161)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	MOPS -- Mathematical optimization system	scientific article

Statements

scholarly article

0 references

MOPS -- Mathematical optimization system (English)

0 references

0 references

European Journal of Operational Research

0 references

publication date

21 April 1994

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(94)90312-3

0 references

The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results

0 references

Analysis of mathematical programming problems prior to applying the simplex algorithm

0 references

0 references

0 references

Updated triangular factors of the basis to maintain sparsity in the product form simplex method

0 references

Solving staircase linear programs by the simplex method, 1: Inversion

0 references

A practicable steepest-edge simplex algorithm

0 references

Pivot selection methods of the Devex LP code

0 references

A general phase-I method in linear programming

0 references

A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases

0 references

Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases

0 references

Finding duplicate rows in a linear programming model

0 references

0 references

The Composite Simplex Algorithm

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0377-2217(94)90312-3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1317161

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1317161&oldid=34120456"