A convergent criss-cross method
From MaRDI portal
Publication:3703581
DOI10.1080/02331938508843067zbMath0581.90052OpenAlexW2117350831WikidataQ60306607 ScholiaQ60306607MaRDI QIDQ3703581
Publication date: 1985
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938508843067
Related Items
A phase-1 approach for the generalized simplex algorithm, New variants of the criss-cross method for linearly constrained convex quadratic programming, Exact methods for large-scale multi-period financial planning problems, Three nearly scaling-invariant versions of an exterior point algorithm for linear programming, A new algorithm for quadratic programming, The role of pivoting in proving some fundamental theorems of linear algebra, Criss-cross methods: A fresh view on pivot algorithms, On the existence of a short pivoting sequence for a linear program, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, The \(s\)-monotone index selection rules for pivot algorithms of linear programming, Some generalizations of the criss-cross method for quadratic programming, A new proof for the criss-cross method for quadratic programming, An exponential example for Terlaky's pivoting rule for the criss-cross simplex method, On the finiteness of the criss-cross method, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, A basis enumeration algorithm for linear systems with geometric applications, A projective simplex algorithm using LU decomposition, Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis, Exterior point simplex-type algorithms for linear and network optimization problems, Efficient nested pricing in the simplex algorithm, Improving a primal–dual simplex-type algorithm using interior point methods, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Unnamed Item, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming, Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems, Optimizing of sums and products of linear fractional functions under linear constraints, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, New method for determining search directions for interior-point algorithms in linear optimization, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, The linear complementarity problem, sufficient matrices, and the criss- cross method, The finite criss-cross method for hyperbolic programming, New criss-cross type algorithms for linear complementarity problems with sufficient matrices, Variants of the Hungarian method for solving linear programming problems, An affine-scaling pivot algorithm for linear programming, Pivot versus interior point methods: Pros and cons, Pivot rules for linear programming: A survey on recent theoretical developments, An exterior point simplex algorithm for (general) linear programming problems, The theory of linear programming:skew symmetric self-dual problems and the central path*, A finite crisscross method for oriented matroids, New variants of finite criss-cross pivot algorithms for linear programming
Cites Work
- Unnamed Item
- The Criss-Cross Method for Solving Linear Programming Problems
- New Finite Pivoting Rules for the Simplex Method
- Duality Theory of Linear Programs: A Constructive Approach with Applications
- Some Empirical Tests of the Criss-Cross Method
- A Combinatorial Algorithm for Linear Programs in the General Mixed Form
