The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
J. A. J. Hall, K. I. M. McKinnon
Abstract
This paper introduces a class of linear programming examples which cause the simplex method to cycle indefinitely and which are the simplest possible examples showing this behaviour. The structure of examples from this class repeats after two iterations. Cycling is shown to occur for both the most negative reduced cost and steepest edge column selection criteria. In addition it is shown that the EXPAND anti-cycling procedure of Gill et al.is not guaranteed to prevent cycling.
Create a lesson
Related papers
Risk-Sensitive Stochastic Optimal Control on Positive Cones
Mohamad Al Ahdab, John-Josef Leth
Deterministic Oracle Complexity for Goldstein Stationarity in Nonsmooth Nonconvex Optimization with Constraints
Yixi Ding, Ya-xiang Yuan
Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds
Adam Pooley, William Warke, Matthew T. Hale
Multi-Step Performance Estimation for Gradient Descent under the Polyak Lojasiewicz Condition
Wanli Hong, Shuyang Ling
Robust Markov Decision Processes: An Introduction Using Convex Optimization and Game Theory
Julien Grand-Clément
Dual-Mode Extremum Seeking for Diffusion Systems with Boundary-Cost Feedback
Martin Guay, Denis Dochain