| A Network Algorithm for Realizing Constructivelythe Farkas Lemma Arising from the Quasi-Generalized Network |
| |
| 作者姓名： | ZHEMIN WANG XIANBIN HUANG FAN XU |
| |
| 作者单位： | Department of Statistics and Operations Research，Fadan University，Shanghai 200433，P.R.China |
| |
| 摘 要： | 1.IntroductionLetRIbethespaceofallrealvectorsindexedbyelementsofafiniteseti,icachosenelemelltofi,SandS*apairofcompletelyorthogonalsubspacesofRI.Foragivenpartition(PI,P2,P3,P4)ofI--{ic}(i.e.PIuPZuP3uP4=I--{eo},andPinPj=acfori/j),letF={axled6S,Ax'.>0,Ax.20fore6PI,Ax.50foreEP2,Ax.~0foreEP3},F*={dyIAyES*,ac.>0,ace30foreEPI,ac50foreEP2,ac.~0foreEP4}.Now,theFarkasLemmacanbegenerallydescribedas1]:oneandonlyoneofthefollowingtwostatemelltsholds:(i)ThereexistsaaxEF.(n)Thereexistsaac…
|
A Network Algorithm for Realizing Constructively the Farkas Lemma Arising from the Quasi-Generalized Network |
| |
| ZHEMIN WANG, XIANBIN HUANG, FAN XU.A Network Algorithm for Realizing Constructivelythe Farkas Lemma Arising from the Quasi-Generalized Network[J].OR Transactions,1998(4). |
| |
| Authors: | ZHEMIN WANG XIANBIN HUANG FAN XU |
| |
| Abstract: | This paper presents a network algorithm for realizing constructively the FarkasLemma arising from the so-called quasi-generalized network. This algorithm is stonglypolynomial when the network is a quasi-pure network, and turns out the Minty's PaintingMethod when the network is a pure network. |
| |
| Keywords: | Farkas Lemma quasi-generalized network generalized network quasipure network pure network |
| 本文献已被 CNKI 等数据库收录！ |
|
