Pivoting rules for the revised simplex algorithm

DOI10.2298/YJOR140228016PzbMath1474.90282OpenAlexW2033702232MaRDI QIDQ2975441

Nikolaos Samaras, Nikolaos Ploskas

Publication date: 11 April 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor140228016p

zbMATH Keywords

linear programmingpricingrevised simplex methodpivoting rules

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (8)

Efficient GPU-based implementations of simplex type algorithms ⋮ A double-pivot simplex algorithm and its upper bounds of the iteration numbers ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ Unnamed Item ⋮ Steepest-edge rule and its number of simplex iterations for a nondegenerate LP ⋮ A space decomposition-based deterministic algorithm for solving linear optimization problems ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm ⋮ Reinforcement learning of simplex pivot rules: a proof of concept

This page was built for publication: Pivoting rules for the revised simplex algorithm