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)
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Related Items
Credal ensembles of classifiers, Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points, New bounds and asymptotic expansions for the volume of the unit ball in \(\mathbb{R}^n\) based on Padé approximation, Schwarz-Pick lemma for harmonic and hyperbolic harmonic functions, Linear programming, the simplex algorithm and simple polytopes, Criss-cross methods: A fresh view on pivot algorithms, Polynomial time algorithms for some classes of constrained nonconvex quadratic problems, Implementing the simplex method as a cutting-plane method, with a view to regularization, A linear programming primer: from Fourier to Karmarkar, On the variance of the number of pivot steps required by the simplex algorithm, A path-following method for finding multiple equilibrium points in cellular neural networks, Sharp inequalities related to the volume of the unit ball in \(\mathbb{R}^n\), The Polyhedral Geometry of Pivot Rules and Monotone Paths, Universality for Eigenvalue Algorithms on Sample Covariance Matrices, Monotone paths on cross-polytopes, A spectral Bernstein theorem, Convex geometry and its applications. Abstracts from the workshop held December 12--18, 2021 (hybrid meeting), Estimating support functions of random polytopes via Orlicz norms, A counterexample to the Hirsch conjecture, Monotonicity properties of the volume of the unit ball in \({\mathbb{R}^{n}}\), Inequalities for the volume of the unit ball in \(\mathbb R^n\), Linear programming with spheres and hemispheres of objective vectors, Series associated to some expressions involving the volume of the unit ball and applications, The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model, Inequalities and asymptotic expansions related to the volume of the unit ball in \(\mathbb{R}^n\), Simplex-inspired algorithms for solving a class of convex programming problems, Some properties of the gamma and psi functions, with applications, Volume of unit ball in an n-dimensional normed space and its asymptotic properties, On the shadow simplex method for curved polyhedra, Iterative computation of security strategies of matrix games with growing action set, A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges, Random Projections for Linear Programming, Sharp inequalities for the digamma and polygamma functions, Book Review: The basic George B. Dantzig, Moser's shadow problem, \(S\)-hypersimplices, pulling triangulations, and monotone paths, Optimizing MSE for clustering with balanced size constraints, A Generalized Simplex Method for Integer Problems Given by Verification Oracles, Average number of iterations of some polynomial interior-point -- algorithms for linear programming, Unnamed Item, Frontiers of sphere recognition in practice, 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
