New Finite Pivoting Rules for the Simplex Method
From MaRDI portal
Publication:4196237
DOI10.1287/moor.2.2.103zbMath0408.90050OpenAlexW2082824470WikidataQ55923389 ScholiaQ55923389MaRDI QIDQ4196237
Publication date: 1977
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/874b988e359f63c8068226c53ef0a9bcd54e5e4d
Related Items
A phase-1 approach for the generalized simplex algorithm, A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming, Linear and combinatorial sharing problems, A convergent criss-cross method, A hybrid algorithm for solving convex separable network flow problems, A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\), A note on the Edmonds-Fukuda pivoting rule for simplex algorithms, Primal and dual active-set methods for convex quadratic programming, A Z-simplex algorithm with partial updates, A linear programming decomposition focusing on the span of the nondegenerate columns, Standard forms for rational linear arithmetic in constraint logic programming., Survey of solved and open problems in the degeneracy phenomenon, Affirmative action algorithms, A dual approach to primal degeneracy, An experimental investigation of enumerative methods for the linear complementarity problem, A note on degeneracy in linear programming, 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, Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function, The role of pivoting in proving some fundamental theorems of linear algebra, Parametric linear programming and anti-cycling pivoting rules, A simple direct cosine simplex algorithm, The positive edge criterion within COIN-OR's CLP, Criss-cross methods: A fresh view on pivot algorithms, A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy, Making progress during a stall in the simplex algorithm, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, Subspaces with well-scaled frames, Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm, The \(s\)-monotone index selection rules for pivot algorithms of linear programming, Circuit walks in integral polyhedra, On the Number of Solutions Generated by the Simplex Method for LP, A divide-and-conquer algorithm for binary matrix completion, On the simplex algorithm initializing, Customizing the solution process of COIN-OR's linear solvers with python, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Multi-parametric solution-path algorithm for instance-weighted support vector machines, Unimodular modules, Canonical bases in linear programming, A tree traversal algorithm for decision problems in knot theory and 3-manifold topology, An exponential example for Terlaky's pivoting rule for the criss-cross simplex method, Edges versus circuits: a hierarchy of diameters in polyhedra, A note on the continuity of solutions of parametric linear programs, The basis suppression method, Degeneracy resolution for bilinear utility functions, Structure on the top homology and related algorithms, On anti-cycling pivoting rules for the simplex method, Quantifier elimination in automatic loop parallelization, A sequential LCP method for bilevel linear programming, Exterior point simplex-type algorithms for linear and network optimization problems, A largest-distance pivot rule for the simplex algorithm, Efficient nested pricing in the simplex algorithm, The double pivot simplex method, On finding and detecting efficient assignments in the case of multiple inputs and outputs, A new pivoting rule for solving various degeneracy problems, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, An exterior simplex type algorithm for the minimum cost network flow problem, A primal-dual simplex method for linear programs, A primal deficient-basis simplex algorithm for linear programming, Multi-phase dynamic constraint aggregation for set partitioning type problems, Equivalence of some quadratic programming algorithms, Primal transportation and transshipment algorithms, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, A combinatorial abstraction of linear programming, A new version of the improved primal simplex for degenerate linear programs, A degeneracy exploiting LU factorization for the simplex method, Courtship and linear programming, A basis-defiency-allowing variation of the simplex method for linear programming, A practical anti-cycling procedure for linearly constrained optimization, The discrete moment problem and linear programming, Modeling the satellite placement problem as a network flow problem with one side constraint, Practical finite pivoting rules for the simplex method, A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties, Least-index resolution of degeneracy in quadratic programming, Linear max-min programming, 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, The Stable Evaluation of Multivariate Simplex Splines, On the structure of the set bases of a degenerate point, Bi-objective multistage stochastic linear programming, Pivoting rules and redundancy schemes in extreme point enumeration, Pivot versus interior point methods: Pros and cons, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Advances in design and implementation of optimization software, 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, Multiparametric demand transportation problem, Dealing with degeneracy in reduced gradient algorithms, A finite crisscross method for oriented matroids, New variants of finite criss-cross pivot algorithms for linear programming, Measuring inconsistency, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey, A simplex-like method with bisection for linear programming1, 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, Some generalizations of the criss-cross method for quadratic programming, A new proof for the criss-cross method for quadratic programming, Finiteness of Criss-Cross Method in Complementarity Problem, A quadratic simplex algorithm for primal optimization over zero-one polytopes, Improving a primal–dual simplex-type algorithm using interior point methods, Solution procedures for multi-objective markov decision processes, The pivot and probe algorithm for solving a linear program, Unnamed Item, Modification and implementation of two-phase simplex method, Unnamed Item, Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution, Variants of the Hungarian method for solving linear programming problems, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer
