full
search.png

Search

close.png

Cancel

arrow
Volume 8, Issue 1
A Method of Finding a Strictly Feasible Solution for Linear Constraints

Zi-Luan Wei

J. Comp. Math., 8 (1990), pp. 16-22.

Published online: 1990-08

Preview Full PDF 2910 26166

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-8-16, author = {Wei , Zi-Luan}, title = {A Method of Finding a Strictly Feasible Solution for Linear Constraints}, journal = {Journal of Computational Mathematics}, year = {1990}, volume = {8}, number = {1}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9415.html} }
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 -

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.

Wei , Zi-Luan. (1990). A Method of Finding a Strictly Feasible Solution for Linear Constraints. Journal of Computational Mathematics. 8 (1). 16-22. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard