scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199004)37:2<279::AID-NAV3220370207>3.0.CO;2-V" /><279::AID-NAV3220370207>3.0.CO;2-V 10.1002/1520-6750(199004)37:2<279::AID-NAV3220370207>3.0.CO;2-VzbMath0699.90089MaRDI QIDQ3478274

F. M. Pires, Joaquim Joao Júdice

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

upper boundslinear complementarityP-matrixnonsingular M-matriceslarge-scale sparse problemsBard-type direct methodMurty's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

Basic-set algorithm for a generalized linear complementarity problem ⋮ A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Cites Work

• Heavy Traffic Characteristics of a Circular Data Network
• Unnamed Item
• Unnamed Item

This page was built for publication: