Implementing the simplex method for the Optimization Subroutine Library
From MaRDI portal
Publication:4323674
DOI10.1147/sj.311.0011zbMath0814.90075OpenAlexW2009667013MaRDI QIDQ4323674
No author found.
Publication date: 20 February 1995
Published in: IBM Systems Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/sj.311.0011
Numerical mathematical programming methods (65K05) Linear programming (90C05) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)
Related Items (10)
A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗ ⋮ Presolving in linear programming ⋮ Solving a class of LP problems with a primal-dual logarithmic barrier method ⋮ Parallel algorithm for solving linear programming problem under conditions of incomplete data ⋮ Steepest-edge simplex algorithms for linear programming ⋮ A new neural network for solving linear programming problems ⋮ An interactive graphic presentation for multiobjective linear programming. ⋮ Pivot versus interior point methods: Pros and cons ⋮ Advances in design and implementation of optimization software ⋮ Pivot rules for linear programming: A survey on recent theoretical developments
Uses Software
This page was built for publication: Implementing the simplex method for the Optimization Subroutine Library
