Implementing interior point linear programming methods in the Optimization Subroutine Library

DOI10.1147/sj.311.0026zbMath0814.90076OpenAlexW1986557329MaRDI QIDQ4323675

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.0026

zbMATH Keywords

interior point barrier methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Packaged methods for numerical algorithms (65Y15)

Related Items (6)

SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER ⋮ A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗ ⋮ On solving stochastic production planning problems via scenario modelling ⋮ Solving a class of LP problems with a primal-dual logarithmic barrier method ⋮ Advances in design and implementation of optimization software ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

Uses Software

• OSL

This page was built for publication: Implementing interior point linear programming methods in the Optimization Subroutine Library