Title of article
Linear Programming, the Simplex Algorithm and Simple Polytopes
Author/Authors
Bhusan ، Das Sashi - Balasore College of Engineering Technology , Bagaban ، Biswal - Fakir Mohan Autonomous College (F.M. Autonomous College) , Tripathy ، J.P - Gurukul Institute of Bhubaneswar
Pages
18
From page
702
To page
719
Abstract
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.
Keywords
simplex algorithm , Randomized Pivot rule complexity combinational theory of simple polytopes
Journal title
Iranian Journal of optimization
Serial Year
2014
Journal title
Iranian Journal of optimization
Record number
2469711
Link To Document