On the connectedness of the set of almost complementary paths of a linear complementarity problem

Wayne P. Hallman; Ikuyo Kaneko

doi:10.1007/BF01582124

On the connectedness of the set of almost complementary paths of a linear complementarity problem

Wayne P. Hallman, Ikuyo Kaneko

政策･メディア研究科

研究成果: Article › 査読

1 被引用数 (Scopus)

本文言語	English
ページ（範囲）	384-385
ページ数	2
ジャーナル	Mathematical Programming
巻	16
号	1
DOI	https://doi.org/10.1007/BF01582124
出版ステータス	Published - 1979 12月 1

ASJC Scopus subject areas

ソフトウェア
数学一般

文献へのアクセス

10.1007/BF01582124

他のファイルとリンク

引用スタイル

@article{b8fe8418b7354e599a8f2a3ea32d6f5a,

title = "On the connectedness of the set of almost complementary paths of a linear complementarity problem",

keywords = "Almost Complementary Paths, Bimatrix Game, Connectedness, Linear Complementarity Problem",

author = "Hallman, {Wayne P.} and Ikuyo Kaneko",

year = "1979",

month = dec,

day = "1",

doi = "10.1007/BF01582124",

language = "English",

volume = "16",

pages = "384--385",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1",

}

TY - JOUR

T1 - On the connectedness of the set of almost complementary paths of a linear complementarity problem

AU - Hallman, Wayne P.

AU - Kaneko, Ikuyo

PY - 1979/12/1

Y1 - 1979/12/1

KW - Almost Complementary Paths

KW - Bimatrix Game

KW - Connectedness

KW - Linear Complementarity Problem

UR - http://www.scopus.com/inward/record.url?scp=34250260742&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250260742&partnerID=8YFLogxK

U2 - 10.1007/BF01582124

DO - 10.1007/BF01582124

M3 - Article

AN - SCOPUS:34250260742

SN - 0025-5610

VL - 16

SP - 384

EP - 385

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1

ER -