An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
From MaRDI portal
Publication:4302320
DOI10.1137/0804023zbMath0820.90069OpenAlexW1974421881MaRDI QIDQ4302320
Publication date: 14 August 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0804023
Numerical mathematical programming methods (65K05) Linear programming (90C05) Decomposition methods (49M27)
Related Items (4)
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution ⋮ Solving real-world linear ordering problems using a primal-dual interior point cutting plane method ⋮ Active-set prediction for interior point methods using controlled perturbations
This page was built for publication: An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
