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

Saved in:

Bibliographic Details
Published in:	Mathematical methods of operations research (Heidelberg, Germany) Vol. 49; no. 2; pp. 175 - 210
Main Authors:	BORGWARDT, K. H, HUHN, P
Format:	Journal Article
Language:	English
Published:	Heidelberg Physica 01.01.1999
Subjects:	Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science Geometry Lower bound Stochastic model Linear programming Simplex method Algorithm complexity
ISSN:	1432-2994
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!