Implementing the simplex method for the Optimization Subroutine Library
From MaRDI portal
Recommendations
- A numerically exact implementation of the simplex method
- Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
- Implementing interior point linear programming methods in the Optimization Subroutine Library
- Computational aspects of linear programming simplex method
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
Cited in
(14)- An interactive graphic presentation for multiobjective linear programming.
- A numerically exact implementation of the simplex method
- Presolving in linear programming
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗
- A new neural network for solving linear programming problems
- The simplex method as a global optimizer: A C-programming perspective
- Parallel algorithm for solving linear programming problem under conditions of incomplete data
- Solving a class of LP problems with a primal-dual logarithmic barrier method
- Pivot rules for linear programming: A survey on recent theoretical developments
- Advances in design and implementation of optimization software
- Steepest-edge simplex algorithms for linear programming
- An advanced macro spreadsheet program for the simplex method
- Pivot versus interior point methods: Pros and cons
This page was built for publication: Implementing the simplex method for the Optimization Subroutine Library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323674)
