فهرس المقالات Randomized Pivot rule complexity combinational theory of simple polytopes

• حرية الوصول المقاله
  • صفحة الملخص
  • نص كامل
  
  1 - Linear Programming, the Simplex Algorithm and Simple Polytopes
  Das Bhusan Biswal Bagaban J.P Tripathy
  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-exp أکثر

  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. تفاصيل المقالة