Steepest-edge rule and its number of simplex iterations for a nondegenerate LP

Masaya Tano, Ryuhei Miyashiro, Tomonari Kitahara

Research output: Contribution to journalArticle

Abstract

In this paper, we consider the number of simplex iterations with the steepest-edge rule for the simplex method. For a nondegenerate linear programming problem, we show two upper bounds for the number of iterations of the simplex method with the steepest-edge rule via analysis of the p-norm rule, which is a previously proposed generalization of the steepest-edge rule.

Original languageEnglish
Pages (from-to)151-156
Number of pages6
JournalOperations Research Letters
Volume47
Issue number3
DOIs
Publication statusPublished - May 1 2019

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Steepest-edge rule and its number of simplex iterations for a nondegenerate LP'. Together they form a unique fingerprint.

  • Cite this