Implementing interior point linear programming methods in the Optimization Subroutine Library
From MaRDI portal
Recommendations
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- scientific article; zbMATH DE number 1069182
- Vector processing in simplex and interior methods for linear programming
- The design and application of IPMLO. A FORTRAN library for linear optimization with interior point methods
- scientific article; zbMATH DE number 1047679
Cited in
(12)- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
- Implementing the simplex method for the Optimization Subroutine Library
- A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗
- On solving stochastic production planning problems via scenario modelling
- scientific article; zbMATH DE number 1783867 (Why is no real title available?)
- Vector processing in simplex and interior methods for linear programming
- Solving a class of LP problems with a primal-dual logarithmic barrier method
- Exploiting hardware capabilities in interior point methods
- User'S guide To Lipsol linear-programming interior point solvers V0.4
- Advances in design and implementation of optimization software
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
This page was built for publication: Implementing interior point linear programming methods in the Optimization Subroutine Library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323675)
