Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems

Xiaojun Chen, Hailin Sun, Huifu Xu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

54 Citations (Scopus)

Abstract

In this paper, we propose a discretization scheme for the two-stage stochastic linear complementarity problem (LCP) where the underlying random data are continuously distributed. Under some moderate conditions, we derive qualitative and quantitative convergence for the solutions obtained from solving the discretized two-stage stochastic LCP (SLCP). We explain how the discretized two-stage SLCP may be solved by the well-known progressive hedging method (PHM). Moreover, we extend the discussion by considering a two-stage distributionally robust LCP (DRLCP) with moment constraints and proposing a discretization scheme for the DRLCP. As an application, we show how the SLCP and DRLCP models can be used to study equilibrium arising from two-stage duopoly game where each player plans to set up its optimal capacity at present with anticipated competition for production in future.

Original languageEnglish
Pages (from-to)1-35
Number of pages35
JournalMathematical Programming
DOIs
Publication statusAccepted/In press - 30 Mar 2018

Keywords

  • Discrete approximation
  • Distributionally robust linear complementarity problem
  • Error bound
  • Ex post equilibrium
  • Two-stage stochastic linear complementarity problem

ASJC Scopus subject areas

  • Software
  • General Mathematics

Fingerprint

Dive into the research topics of 'Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems'. Together they form a unique fingerprint.

Cite this