Ideas leading to a better bound on the average number of pivot steps for solving an LP

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: In: Operations Research Proceedings, 1997, S. 1-12

Event: Veröffentlichung

(where): Augsburg, Berlin

(who): Universität Augsburg, Springer

(when): 1998

Creator: Borgwardt, Karl Heinz

DOI: 10.1007/978-3-642-58891-4_1

URN: urn:nbn:de:bvb:384-opus4-262269

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:47 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Borgwardt, Karl Heinz
Universität Augsburg, Springer

Time of origin

1998

Other Objects (12)

A lower bound on the average number of Pivot-steps for solving linear programs: valid for all variants of the simplex-algorithm

The Average Number of Pivot Steps of the Simplex-Algorithm Based on a Generalized Rotation-Symmetry-Model

Dia

Steps leading leading to the Tombs of the Kings [Jerusalem]

Arbeitspapier

Solving DSGE models with a nonlinear moving average

Solving DSGE Models with a Nonlinear Moving Average

On the Number of Pivot Steps Required by the Simplex Algorithm

Werk

Pivot

Modular pivot

Abschnitt

Madame Pivot

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

A lower bound on the average number of Pivot-steps for solving linear programs: valid for all variants of the simplex-algorithm

The Average Number of Pivot Steps of the Simplex-Algorithm Based on a Generalized Rotation-Symmetry-Model

Dia

Steps leading leading to the Tombs of the Kings [Jerusalem]

Arbeitspapier

Solving DSGE models with a nonlinear moving average

Solving DSGE Models with a Nonlinear Moving Average

On the Number of Pivot Steps Required by the Simplex Algorithm

Werk

Pivot

Modular pivot

Abschnitt

Madame Pivot

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

A lower bound on the average number of Pivot-steps for solving linear programs: valid for all variants of the simplex-algorithm

The Average Number of Pivot Steps of the Simplex-Algorithm Based on a Generalized Rotation-Symmetry-Model

Dia

Steps leading leading to the Tombs of the Kings [Jerusalem]

Arbeitspapier

Solving DSGE models with a nonlinear moving average

Solving DSGE Models with a Nonlinear Moving Average

On the Number of Pivot Steps Required by the Simplex Algorithm

Werk

Pivot

Modular pivot

Abschnitt

Madame Pivot

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Ideas leading to a better bound on the average number of pivot steps for solving an LP

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

A lower bound on the average number of Pivot-steps for solving linear programs: valid for all variants of the simplex-algorithm

The Average Number of Pivot Steps of the Simplex-Algorithm Based on a Generalized Rotation-Symmetry-Model

Steps leading leading to the Tombs of the Kings [Jerusalem]

Solving DSGE models with a nonlinear moving average

Solving DSGE Models with a Nonlinear Moving Average

On the Number of Pivot Steps Required by the Simplex Algorithm

Pivot

Pivot

Modular pivot

Madame Pivot

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

A lower bound on the average number of Pivot-steps for solving linear programs: valid for all variants of the simplex-algorithm

The Average Number of Pivot Steps of the Simplex-Algorithm Based on a Generalized Rotation-Symmetry-Model

Steps leading leading to the Tombs of the Kings [Jerusalem]

Solving DSGE models with a nonlinear moving average

Solving DSGE Models with a Nonlinear Moving Average

On the Number of Pivot Steps Required by the Simplex Algorithm

Pivot

Pivot

Modular pivot

Madame Pivot

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

A lower bound on the average number of Pivot-steps for solving linear programs: valid for all variants of the simplex-algorithm

The Average Number of Pivot Steps of the Simplex-Algorithm Based on a Generalized Rotation-Symmetry-Model

Steps leading leading to the Tombs of the Kings [Jerusalem]

Solving DSGE models with a nonlinear moving average

Solving DSGE Models with a Nonlinear Moving Average

On the Number of Pivot Steps Required by the Simplex Algorithm

Pivot

Pivot

Modular pivot

Madame Pivot

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm

Related objects

Reset password