The simplex method. A probabilistic analysis
From MaRDI portal
Publication:1083366
zbMath0604.90092MaRDI QIDQ1083366
Publication date: 1987
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
49-02: Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control
Related Items
Sharp inequalities for the digamma and polygamma functions, Some properties of the gamma and psi functions, with applications, On the variance of the number of pivot steps required by the simplex algorithm, Book Review: The basic George B. Dantzig, Implementing the simplex method as a cutting-plane method, with a view to regularization, A counterexample to the Hirsch conjecture, The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model, A spectral Bernstein theorem, Simplex-inspired algorithms for solving a class of convex programming problems, Linear programming with spheres and hemispheres of objective vectors, Pivot rules for linear programming: A survey on recent theoretical developments, A strictly improving linear programming Phase I algorithm, A finite algorithm for solving general quadratic problems, Linear programming, the simplex algorithm and simple polytopes, Criss-cross methods: A fresh view on pivot algorithms, Average number of iterations of some polynomial interior-point -- algorithms for linear programming, Estimating support functions of random polytopes via Orlicz norms, Monotonicity properties of the volume of the unit ball in \({\mathbb{R}^{n}}\), Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points, Inequalities for the volume of the unit ball in \(\mathbb R^n\), Polynomial time algorithms for some classes of constrained nonconvex quadratic problems, Volume of unit ball in an n-dimensional normed space and its asymptotic properties, A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges, A path-following method for finding multiple equilibrium points in cellular neural networks
