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

Wayne P. Hallman, Ikuyo Kaneko

Research output: Contribution to journalArticle

1 Citation (Scopus)
Original languageEnglish
Pages (from-to)384-385
Number of pages2
JournalMathematical Programming
Volume16
Issue number1
DOIs
Publication statusPublished - 1979 Dec
Externally publishedYes

Fingerprint

Bimatrix Games
Linear Complementarity Problem
Connectedness
Path
Linear complementarity problem
Bimatrix games

Keywords

  • Almost Complementary Paths
  • Bimatrix Game
  • Connectedness
  • Linear Complementarity Problem

ASJC Scopus subject areas

  • Applied Mathematics
  • Mathematics(all)
  • Safety, Risk, Reliability and Quality
  • Management Science and Operations Research
  • Software
  • Computer Graphics and Computer-Aided Design
  • Computer Science(all)

Cite this

On the connectedness of the set of almost complementary paths of a linear complementarity problem. / Hallman, Wayne P.; Kaneko, Ikuyo.

In: Mathematical Programming, Vol. 16, No. 1, 12.1979, p. 384-385.

Research output: Contribution to journalArticle

@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 = "12",
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

Y1 - 1979/12

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

VL - 16

SP - 384

EP - 385

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1

ER -