Solution of parametric vertical block linear complementarity problems

被引：2
作者：
Chakraborty, B. [1 ]
Biswal, M. P. [1 ]
Nanda, S. [1 ]
机构：
[1] Indian Inst Technol, Dept Math, Kharagpur 721302, W Bengal, India
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2007年 / 84卷 / 03期
关键词：
parametric linear complementarity problem; vertical block matrix; vertical block linear complementarity problem; P-matrix; vertical block P-matrix;
D O I：
10.1080/00207160601138962
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The parametric vertical block linear complementarity problem is introduced where the associated vertical block matrix and the column vector are parametric. Assuming the matrix to be a vertical block P-matrix, an algorithm is developed for solving vertical block linear complementarity problems. A necessary and sufficient condition is also derived to ensure the same solution basis for any parametric input of the vertical block P-matrix. Based on these, an algorithm is proposed and the solution of the parametric vertical block linear complementarity problem is obtained. A numerical example is presented to illustrate the use of the method.
引用
收藏
页码：325 / 332
页数：8
相关论文
共 50 条
  • [41] Analysis on the smoothing method for the P-linear complementarity systems
    Yang, W. H.
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2010, 72 (3-4) : 1961 - 1966
  • [42] Pivoting in Linear Complementarity: Two Polynomial-Time Cases
    Foniok, Jan
    Fukuda, Komei
    Gaertner, Bernd
    Luethi, Hans-Jakob
    DISCRETE & COMPUTATIONAL GEOMETRY, 2009, 42 (02) : 187 - 205
  • [43] On Some Properties of K-type Block Matrices in the Context of Complementarity Problem
    Dutta, A.
    Das, A. K.
    MATHEMATICS AND COMPUTING, ICMC 2022, 2022, 415 : 143 - 154
  • [44] A simple P-matrix linear complementarity problem for discounted games
    Jurdzinski, Marcin
    Savani, Rahul
    LOGIC AND THEORY OF ALGORITHMS, 2008, 5028 : 283 - 293
  • [45] AN INTERIOR POINT POTENTIAL REDUCTION ALGORITHM FOR THE LINEAR COMPLEMENTARITY-PROBLEM
    KOJIMA, M
    MEGIDDO, N
    YE, YY
    MATHEMATICAL PROGRAMMING, 1992, 54 (03) : 267 - 279
  • [46] New error bounds for the linear complementarity problem with an SB-matrix
    Dai, Ping-Fan
    Lu, Chang-Jing
    Li, Yao-Tang
    NUMERICAL ALGORITHMS, 2013, 64 (04) : 741 - 757
  • [47] Strictly semi-positive tensors and the boundedness of tensor complementarity problems
    Song, Yisheng
    Qi, Liqun
    OPTIMIZATION LETTERS, 2017, 11 (07) : 1407 - 1426
  • [48] New error bound for linear complementarity problem of S -S DDS -B matrices
    Liu, Lanlan
    Han, Pan
    Wang, Feng
    AIMS MATHEMATICS, 2021, 7 (02): : 3239 - 3249
  • [49] A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
    Gaertner, Bernd
    Sprecher, Markus
    OPERATIONS RESEARCH LETTERS, 2012, 40 (06) : 484 - 486
  • [50] CODERIVATIVES AND THE SOLUTION MAP OF A LINEAR CONSTRAINT SYSTEM
    Duong Thi Kim Huyen
    Nguyen Dong Yen
    SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (02) : 986 - 1007
12345