MOPS -- Mathematical optimization system

DOI10.1016/0377-2217(94)90312-3MaRDI QIDQ1317161zbMATH OpenOpenAlexFDO

Authors Uwe H. Suhl

Publication date 21 April 1994

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(94)90312-3

Mathematics Subject Classification ID

Theory of programming languages (68N15) Linear programming (90C05)

Cites work

• A general phase-I method in linear programming
• A practicable steepest-edge simplex algorithm
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• Finding duplicate rows in a linear programming model
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 3523480 (Why is no real title available?)
• scientific article; zbMATH DE number 3561084 (Why is no real title available?)
• scientific article; zbMATH DE number 3612766 (Why is no real title available?)
• Pivot selection methods of the Devex LP code
• Solving staircase linear programs by the simplex method, 1: Inversion
• The Composite Simplex Algorithm
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method

Cited in

(9)

• Supernode processing of mixed-integer models
• A hybrid algorithm for solving network flow problems with side constraints.
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• MOPS
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases
• Mathematical models and solution methods for optimal container terminal yard layouts

Describes a project that uses

Uses Software

• DEVEX

This page was built for publication: MOPS -- Mathematical optimization system

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