How fast does the simplex method usually work? Or: the search for (stochastic) independence

DOI10.1515/DMVM-2014-0037zbMATH Open1323.90036OpenAlexW2080043366MaRDI QIDQ2249095FDOQ2249095

Authors: K. H. Borgwardt 

Publication date: 8 July 2014

Published in: Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dmvm-2014-0037

Recommendations

• scientific article; zbMATH DE number 3898607
• scientific article; zbMATH DE number 4197740
• The simplex method. A probabilistic analysis
• New results on the average behavior of simplex algorithms
• A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension

zbMATH Keywords

linear programmingprobabilistic analysissimplex algorithmaverage case complexity

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (4)

• The simplex method. A probabilistic analysis
• On a relationship between record values and Ross’s model of algorithm efficiency
• Title not available (Why is that?)
• The average computing time of the simplex method in a generalized rotational symmetry model

This page was built for publication: How fast does the simplex method usually work? Or: the search for (stochastic) independence

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