TY - JOUR
T1 - A Method of Finding a Strictly Feasible Solution for Linear Constraints
AU - Wei , Zi-Luan
JO - Journal of Computational Mathematics
VL - 1
SP - 16
EP - 22
PY - 1990
DA - 1990/08
SN - 8
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9415.html
KW - 
AB - <p style="text-align: justify;">This paper presents a method of finding a strictly feasible solution for linear constraints. We prove, under certain assumption, that the method is convergent in a finite number of iterations, and give the sufficient and necessary conditions for the infeasibility of the problem. Actually, it can be considered as a constructive proof for the Farkas lemma.</p>