New Finite Pivoting Rules for the Simplex Method

Cited in

(only showing first 100 items - show all)

Pivoting rules and redundancy schemes in extreme point enumeration
A finite crisscross method for oriented matroids
Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
Linear and combinatorial sharing problems
A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
A Z-simplex algorithm with partial updates
Survey of solved and open problems in the degeneracy phenomenon
A dual approach to primal degeneracy
An experimental investigation of enumerative methods for the linear complementarity problem
Degeneracy in the presence of roundoff errors
On the solution of highly degenerate linear programmes
A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
Parametric linear programming and anti-cycling pivoting rules
A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
Making progress during a stall in the simplex algorithm
Subspaces with well-scaled frames
On anti-cycling pivoting rules for the simplex method
A sequential LCP method for bilevel linear programming
A new pivoting rule for solving various degeneracy problems
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
A combinatorial abstraction of linear programming
A practical anti-cycling procedure for linearly constrained optimization
Selected bibliography on degeneracy
Degeneracy graphs: Theory and applications. An updated survey
Combinatoric classes of the transportation problem and their properties
Degeneracy in linear complementarity problems: A survey
Pivot rules for linear programming: A survey on recent theoretical developments
Encounters with degeneracy: A personal view
An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
On some properties of \(0\)-degeneracy graphs
An exterior point simplex algorithm for (general) linear programming problems
A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
Standard forms for rational linear arithmetic in constraint logic programming.
Criss-cross methods: A fresh view on pivot algorithms
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
Pivot versus interior point methods: Pros and cons
Advances in design and implementation of optimization software
Multiparametric demand transportation problem
New variants of finite criss-cross pivot algorithms for linear programming
Measuring inconsistency
A phase-1 approach for the generalized simplex algorithm
Customizing the solution process of COIN-OR's linear solvers with python
Edges versus circuits: a hierarchy of diameters in polyhedra
Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
Courtship and linear programming
A basis-defiency-allowing variation of the simplex method for linear programming
A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function
The \(s\)-monotone index selection rules for pivot algorithms of linear programming
On the simplex algorithm initializing
Multi-parametric solution-path algorithm for instance-weighted support vector machines
Bi-objective multistage stochastic linear programming
A divide-and-conquer algorithm for binary matrix completion
Structure on the top homology and related algorithms
A simple direct cosine simplex algorithm
Unimodular modules
Quantifier elimination in automatic loop parallelization
A largest-distance pivot rule for the simplex algorithm
A primal deficient-basis simplex algorithm for linear programming
The role of pivoting in proving some fundamental theorems of linear algebra
Circuit walks in integral polyhedra
The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
An affine-scaling pivot algorithm for linear programming
On the number of solutions generated by the simplex method for LP
A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
Primal and dual active-set methods for convex quadratic programming
A linear programming decomposition focusing on the span of the nondegenerate columns
Equivalence of some quadratic programming algorithms
The positive edge criterion within COIN-OR's CLP
On finding and detecting efficient assignments in the case of multiple inputs and outputs
Dealing with degeneracy in reduced gradient algorithms
A convergent criss-cross method
A hybrid algorithm for solving convex separable network flow problems
Affirmative action algorithms
A note on degeneracy in linear programming
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
The Stable Evaluation of Multivariate Simplex Splines
Primal transportation and transshipment algorithms
A degeneracy exploiting LU factorization for the simplex method
Least-index resolution of degeneracy in quadratic programming
Linear max-min programming
scientific article; zbMATH DE number 13594 (Why is no real title available?)
A simplex-like method with bisection for linear programming¹
Some generalizations of the criss-cross method for quadratic programming
A new proof for the criss-cross method for quadratic programming
Solution procedures for multi-objective markov decision processes
Improving a primal–dual simplex-type algorithm using interior point methods
Variants of the Hungarian method for solving linear programming problems
Exterior point simplex-type algorithms for linear and network optimization problems
Solving simple stochastic games with few random nodes faster using Bland's rule
Finiteness of Criss-Cross Method in Complementarity Problem
The pivot and probe algorithm for solving a linear program
Modification and implementation of two-phase simplex method
Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer
Tight approximation algorithms for geometric bin packing with skewed items
Inapproximability of shortest paths on perfect matching polytopes
Revisiting degeneracy, strict feasibility, stability, in linear programming

This page was built for publication: New Finite Pivoting Rules for the Simplex Method

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