New error bound for linear complementarity problems for B-matrices

Global error bounds of the extended vertical linear complementarity problems for Dashnic–Zusmanovich matrices and Dashnic–Zusmanovich-B matrices

“…When k = 1, M 0 = I, q 0 = 0, the EVLCP(M, q) comes back to linear complementarity problems (LCP), and when M 0 = I, q 0 = 0, the EVLCP(M, q) reduces to vertical linear complementarity problems (VLCP) [2]. The extended vertical linear complementarity problems are widely used in optimization theory, control theory, neural network model, convergence analysis, sensitive analysis, verification of the solutions, and so on, see [1,[3][4][5][6][7].…”