The simplex algorithm with a new primal and dual pivot rule
From MaRDI portal
Publication:1342283
DOI10.1016/0167-6377(94)90023-XzbMath0812.90115OpenAlexW2086346232MaRDI QIDQ1342283
Hsin-Der Chen, Michael A. Saunders, Panos M. Pardalos
Publication date: 1994
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90023-x
Related Items
Criss-cross methods: A fresh view on pivot algorithms, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, A projective simplex algorithm using LU decomposition, Exterior point simplex-type algorithms for linear and network optimization problems, Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods, The complex interior-boundary method for linear and nonlinear programming with linear constraints, An efficient simplex type algorithm for sparse and dense linear programs., A new efficient primal dual simplex algorithm
Uses Software
Cites Work
