New results on the average behavior of simplex algorithms

No abstract is available for this paper.

• Publication year

  1984

• Venue

  Bulletin of the American Mathematical Society

• Publication date

  1984-10-01

• Fields of study

  Mathematics

• Identifiers
  DOI 10.1090/S0273-0979-1984-15317-5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm

  1986cited by this paper
• Random linear programs with many variables and few constraints

  1986cited by this paper
• Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems

  1986cited by this paper
• A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension

  1985cited by this paper
• On the average number of steps of the simplex method of linear programming

  1983cited by this paper
• The Average number of pivot steps required by the Simplex-Method is polynomial

  1982cited by this paper
• Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method

  1982cited by this paper
• The Problem of the Average Speed of the Simplex Method

  1982cited by this paper
• Computational complexity of parametric linear programming

  1980cited by this paper
• HOW GOOD IS THE SIMPLEX ALGORITHM

  1970cited by this paper
• Linear programming and extensions

  1965influential reference

• The main vertices of a star set and related graph parameters

  2020cites this paper
• Mathematical Decision-Making with Linear and Convex Programming

  2017cites this paper
• A Gentle Introduction to Optimization

  2014cites this paper
• A Counterexample to H. Arsham: “Initialization of the Simplex Algorithm: An Artificial-Free Approach”

  2013cites this paper
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

  2008cites this paper
• Algoritmos para problemas de empacotamento

  2006cites this paper
• Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems

  2004cites this paper
• Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure

  2002cites this paper
• Probabilistic Analysis of Algorithms

  1998cites this paper
• Distance Problems with Dependent Uncertainties

  1998cites this paper
• Efficient Simplex-Like Methods for Equilibria of Nonsymmetric Analog Networks

  1992cites this paper
• On the complexity of computing equilibria for nonsymmetric analog networks

  1991influential citation
• Numerical Computation: The State of the Art

  1990cites this paper
• Trees, stars, and multiple biological sequence alignment

  1989cites this paper
• The d-Step Conjecture and Its Relatives

  1987cites this paper
• Dual barrier functions with superfast rates of convergence for the linear programming problem

  1987cites this paper
• An asymptotic estimate of the average number of steps of the parametric simplex method

  1987cites this paper
• On the expected number of linear complementarity cones intersected by random and semi-random rays

  1986cites this paper
• Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm

  1986cites this paper