scientific article; zbMATH DE number 4197740

zbMATH Open0725.90059MaRDI QIDQ5202839FDOQ5202839

Authors: K. H. Borgwardt 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• The simplex method. A probabilistic analysis
• scientific article; zbMATH DE number 764392
• scientific article; zbMATH DE number 176072
• scientific article; zbMATH DE number 652007
• Probabilistic analysis of condition numbers for linear programming
• scientific article; zbMATH DE number 3188915
• Probabilistic analysis of a differential equation for linear programming
• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view

zbMATH Keywords

surveyprobabilistic analysissimplex methodaverage number of pivot steps

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (19)

• Title not available (Why is that?)
• The simplex method. A probabilistic analysis
• In Praise of Numerical Computation
• Probabilistic analysis of Simpson's quadrature
• Title not available (Why is that?)
• New results on the average behavior of simplex algorithms
• How fast does the simplex method usually work? Or: the search for (stochastic) independence
• The central curve in linear programming
• Title not available (Why is that?)
• Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
• A note on probability assignments in estimating the time to solve linear programs
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the distribution of the number of simplex iterations to optimality
• The Efficiency of the Simplex Method: A Survey
• On the variance of the number of pivot steps required by the simplex algorithm
• On the probabilistic complexity of finding an approximate solution for linear programming

This page was built for publication:

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