Two characterizations of sufficient matrices

Richard W. Cottle; Sy Ming Guu

doi:10.1016/0024-3795(92)90410-C

Two characterizations of sufficient matrices

Richard W. Cottle^*
, Sy Ming Guu

^*Corresponding author for this work

Stanford University

Research output: Contribution to journal › Journal Article › peer-review

19 Scopus citations

Abstract

Two characterizations are given for the class of sufficient matrices defined by Cottle, Pang, and Venkateswaran. The first is a direct translation of the definition into linear-programming terms. The second can be thought of as a generalization of a theorem of T.D. Parsons on P-matrices.

Original language	English
Pages (from-to)	65-74
Number of pages	10
Journal	Linear Algebra and Its Applications
Volume	170
Issue number	C
DOIs	https://doi.org/10.1016/0024-3795(92)90410-C
State	Published - 06 1992
Externally published	Yes

Access to Document

10.1016/0024-3795(92)90410-C

Cite this

@article{10015085cc904a98a0706790d4195e78,

title = "Two characterizations of sufficient matrices",

abstract = "Two characterizations are given for the class of sufficient matrices defined by Cottle, Pang, and Venkateswaran. The first is a direct translation of the definition into linear-programming terms. The second can be thought of as a generalization of a theorem of T.D. Parsons on P-matrices.",

author = "Cottle, \{Richard W.\} and Guu, \{Sy Ming\}",

year = "1992",

month = jun,

doi = "10.1016/0024-3795(92)90410-C",

language = "英语",

volume = "170",

pages = "65--74",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

number = "C",

}

TY - JOUR

T1 - Two characterizations of sufficient matrices

AU - Cottle, Richard W.

AU - Guu, Sy Ming

PY - 1992/6

Y1 - 1992/6

N2 - Two characterizations are given for the class of sufficient matrices defined by Cottle, Pang, and Venkateswaran. The first is a direct translation of the definition into linear-programming terms. The second can be thought of as a generalization of a theorem of T.D. Parsons on P-matrices.

AB - Two characterizations are given for the class of sufficient matrices defined by Cottle, Pang, and Venkateswaran. The first is a direct translation of the definition into linear-programming terms. The second can be thought of as a generalization of a theorem of T.D. Parsons on P-matrices.

UR - https://www.scopus.com/pages/publications/0346814555

U2 - 10.1016/0024-3795(92)90410-C

DO - 10.1016/0024-3795(92)90410-C

M3 - 文章

AN - SCOPUS:0346814555

SN - 0024-3795

VL - 170

SP - 65

EP - 74

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

IS - C

ER -

Two characterizations of sufficient matrices

Abstract

Access to Document

Other files and links

Fingerprint

Cite this