Linear Programming, the Simplex Algorithm and Simple Polytopes

Authors

  • Biswal Bagaban Department of Mathematics F.M.Autonomous College, Balasore, Orissa, India
  • Das Bhusan Department of Mathematics,Balasor college of Engg & Teach. Sergarh, Balasore, Orissa, India
  • J.P Tripathy Department of Mathematics Gurukul Institute of Bhubaneswar,Orissa,India
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. 

Download for Free

Sign up for free to access the full text

Already have an account?login

similar resources

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 06  issue 1

pages  567- 590

publication date 2010-09-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023