Linear Programming, the Simplex Algorithm and Simple Polytopes

Linear Programming, the Simplex Algorithm and Simple Polytopes

Show other versions (1)

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot role...

Full description

Bibliographic Details
Main Authors: Das Bhusan, Biswal Bagaban, J.P Tripathy
Format: Article
Language:English
Published: Islamic Azad University, Rasht Branch 2010-09-01
Series:Iranian Journal of Optimization
Subjects:
Simplex algorithm
Randomized Pivot rule complexity combinational theory of simple polytopes
Online Access:http://ijo.iaurasht.ac.ir/pdf_514145_ea1a75142f8b8780dbdd391fe7c2a870.html
Description
Summary:In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
ISSN:2008-5427
2008-5427

Similar Items