On Finding Primal- and Dual-Optimal Bases
From MaRDI portal
Publication:4025897
DOI10.1287/ijoc.3.1.63zbMath0755.90056MaRDI QIDQ4025897
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.3.1.63
90C60: Abstract computational complexity for mathematical programming problems
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Polynomial Interior Point Cutting Plane Methods, LPAKO: A Simplex-based Linear Programming Program, Experiments with a hybrid interior point/combinatorial approach for network flow problems, On the finite convergence of interior-point algorithms for linear programming, Using fast matrix multiplication to find basic solutions, Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces, Degeneracy in interior point methods for linear programming: A survey, Pivot rules for linear programming: A survey on recent theoretical developments, Finding an interior point in the optimal face of linear programs, Descent approaches for quadratic bilevel programming, Recovering an optimal LP basis from an interior point solution, A new efficient primal dual simplex algorithm, Experimental investigations in combining primal dual interior point method and simplex based LP solvers, Solving real-world linear ordering problems using a primal-dual interior point cutting plane method, On solving stochastic production planning problems via scenario modelling, A general parametric analysis approach and its implication to sensitivity analysis in interior point methods, Modified fictitious play for solving matrix games and linear-programming problems, Balanced matrices, Recovering an optimal LP basis from an optimal dual solution
