Robust solution of monotone stochastic linear complementarity problems

被引:15
|
作者
Xiaojun Chen
Chao Zhang
Masao Fukushima
机构
[1] Hirosaki University,Department of Mathematical Sciences, Faculty of Science and Technology
[2] Kyoto University,Department of Applied Mathematics and Physics, Graduate School of Informatics
来源
Mathematical Programming | 2009年 / 117卷
关键词
Stochastic linear complementarity problem; NCP function; Expected residual minimization; 90C15; 90C33;
D O I
暂无
中图分类号
学科分类号
摘要
We consider the stochastic linear complementarity problem (SLCP) involving a random matrix whose expectation matrix is positive semi-definite. We show that the expected residual minimization (ERM) formulation of this problem has a nonempty and bounded solution set if the expected value (EV) formulation, which reduces to the LCP with the positive semi-definite expectation matrix, has a nonempty and bounded solution set. We give a new error bound for the monotone LCP and use it to show that solutions of the ERM formulation are robust in the sense that they may have a minimum sensitivity with respect to random parameter variations in SLCP. Numerical examples including a stochastic traffic equilibrium problem are given to illustrate the characteristics of the solutions.
引用
收藏
页码:51 / 80
页数:29
相关论文
共 50 条
  • [41] Centers of monotone generalized complementarity problems
    Shida, M
    Shindoh, S
    Kojima, M
    MATHEMATICS OF OPERATIONS RESEARCH, 1997, 22 (04) : 969 - 976
  • [42] THE SOLUTION OF LINEAR COMPLEMENTARITY-PROBLEMS ON AN ARRAY PROCESSOR
    CRYER, CW
    FLANDERS, PM
    HUNT, DJ
    REDDAWAY, SF
    STANSBURY, J
    JOURNAL OF COMPUTATIONAL PHYSICS, 1982, 47 (02) : 258 - 280
  • [43] SOLUTION OF SYMMETRIC LINEAR COMPLEMENTARITY PROBLEMS BY ITERATIVE METHODS
    MANGASARIAN, OL
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1977, 22 (04) : 465 - 485
  • [44] A representation of the solution set of a class of linear complementarity problems
    Huynh The Phung
    OPTIMIZATION, 2016, 65 (02) : 289 - 298
  • [45] An algorithm for the fast solution of symmetric linear complementarity problems
    Morales, Jose Luis
    Nocedal, Jorge
    Smelyanskiy, Mikhail
    NUMERISCHE MATHEMATIK, 2008, 111 (02) : 251 - 266
  • [46] An algorithm for the fast solution of symmetric linear complementarity problems
    José Luis Morales
    Jorge Nocedal
    Mikhail Smelyanskiy
    Numerische Mathematik, 2008, 111 : 251 - 266
  • [47] Linear complementarity as a general solution method to combinatorial problems
    Di Giacomo, Laura
    Patrizi, Giacomo
    Argento, Emanuele
    INFORMS JOURNAL ON COMPUTING, 2007, 19 (01) : 73 - 79
  • [48] Solution of parametric vertical block linear complementarity problems
    Chakraborty, B.
    Biswal, M. P.
    Nanda, S.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2007, 84 (03) : 325 - 332
  • [49] Solvability of monotone tensor complementarity problems
    Zhang, Liping
    Sun, Defeng
    Luan, Zhenting
    SCIENCE CHINA-MATHEMATICS, 2023, 66 (03) : 647 - 664
  • [50] BOUNDS FOR THE SOLUTION SET OF LINEAR COMPLEMENTARITY-PROBLEMS
    PARDALOS, PM
    ROSEN, JB
    DISCRETE APPLIED MATHEMATICS, 1987, 17 (03) : 255 - 261