Year: 1990
Author: Zi-Luan Wei
Journal of Computational Mathematics, Vol. 8 (1990), Iss. 1 : pp. 16–22
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1990-JCM-9415
Journal of Computational Mathematics, Vol. 8 (1990), Iss. 1 : pp. 16–22
Published online: 1990-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 7