Pivoting rules for the revised simplex algorithm

DOI10.2298/YJOR140228016PMaRDI QIDQ2975441zbMATH OpenOpenAlexFDO

Authors Nikolaos Ploskas, Nikolaos Samaras

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 programmingpivoting rulespricingrevised simplex method

Mathematics Subject Classification ID

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

Cited in

(8)

• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Reinforcement learning of simplex pivot rules: a proof of concept
• A double-pivot simplex algorithm and its upper bounds of the iteration numbers
• Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
• A space decomposition-based deterministic algorithm for solving linear optimization problems
• scientific article; zbMATH DE number 6913921 (Why is no real title available?)
• Improving a primal–dual simplex-type algorithm using interior point methods
• Efficient GPU-based implementations of simplex type algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975441)