logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Identifying an optimal basis in linear programming

delete1996-12-01
delete5
PRE
AI
S
Stephen A. Vavasis
Y
Yinyu Ye
DOI：10.1007/BF02206830delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We propose a sufficient condition that allows an optimal basis to be identified from a central path point in a linear programming problem. This condition can be applied when there is a ''gap'' in the sorted list of slack values. Unlike previously known conditions, this condition is valid for real-number data and does not involve the number of bits in the data.
Keywords:
POLYNOMIAL-TIME ALGORITHM
NONLINEAR GEOMETRY
SCALED PROJECTIONS
PSEUDOINVERSES
TRAJECTORIES

Journal

Annals of Operations Research cover
Annals of Operations Research
IF:
4.5
Papers:
8.0K
Citations:
2.1W

Organization

No organization information available