On the optimal pivot path of simplex method for linear programming based on reinforcement learning

Anqi Li, Tiande Guo, Congying Han +2

Based on the existing pivot rules, the simplex method for linear programming is not polynomial in the worst case. Therefore the optimal pivot of the simplex method is crucial. This…