Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
From MaRDI portal
Publication:4020667
DOI10.1287/ijoc.1.4.287zbMath0752.90046OpenAlexW2108894884MaRDI QIDQ4020667
Roy E. Marsten, J. F. Ballintijn, David F. Shanno, George S. Pierce, Matthew J. Saltzman
Publication date: 17 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1.4.287
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Interior dual proximal point algorithm for linear programs, Recovering an optimal LP basis from an interior point solution, A strongly polynomial contraction-expansion algorithm for network flow problems, The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points, SLP-IOR: An interactive model management system for stochastic linear programs, An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points, An interior point method for general large-scale quadratic programming problems, Modified fictitious play for solving matrix games and linear-programming problems, On finding a vertex solution using interior point methods, Symmetric indefinite systems for interior point methods, The role of the augmented system in interior point methods, A parallel interior point algorithm for linear programming on a network of transputers, Degeneracy in interior point methods for linear programming: A survey, Splitting dense columns in sparse linear systems, Computational experience with a primal-dual interior point method for linear programming, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, Updating lower bounds when using Karmarkar's projective algorithm for linear programming
