Random linear programs with many variables and few constraints

DOI10.1007/BF01582163zbMath0584.90056MaRDI QIDQ3710288

No author found.

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

average-case analysisrandom linear programsexpected number of pivotsnew versions of the simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps ⋮ Random inequality constraint systems with few variables

Cites Work

• Unnamed Item
• On the average number of steps of the simplex method of linear programming
• Linear Programming in Linear Time When the Dimension Is Fixed
• Random polytopes: Their definition, generation and aggregate properties
• The Number of Outcomes in the Pareto-Optimal Set of Discrete Bargaining Games
• Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
• On Finding the Maxima of a Set of Vectors
• On the Average Number of Maxima in a Set of Vectors and Applications

This page was built for publication: Random linear programs with many variables and few constraints