The existence of a strongly polynomial time simplex method release_u7rbemhmbjakzbnlk6iqbe2ouy

by Zi-zong Yan, Xiang-jun Li, Jinhai Guo

Released as a article .

2021  

Abstract

It is well known how to clarify whether there is a polynomial time simplex algorithm for linear programming (LP) is the most challenging open problem in optimization and discrete geometry. This paper gives a affirmative answer to this open question by the use of the parametric analysis technique that we recently proposed. We show that there is a simplex algorithm whose number of pivoting steps does not exceed the number of variables of a LP problem.
In text/plain format

Archived Files and Locations

application/pdf  397.2 kB
file_upbusxnwv5b4ffrkefas7onlie
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-08-12
Version   v7
Language   en ?
arXiv  2006.11466v7
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 55a5abcc-f3be-4072-88d0-a60b5c049730
API URL: JSON