IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v76y2020i2d10.1007_s10589-020-00185-z.html
   My bibliography  Save this article

Quantitative analysis for a class of two-stage stochastic linear variational inequality problems

Author

Listed:
  • Jie Jiang

    (Chongqing University
    The Hong Kong Polytechnic University)

  • Xiaojun Chen

    (The Hong Kong Polytechnic University)

  • Zhiping Chen

    (Xi’an Jiaotong University)

Abstract

This paper considers a class of two-stage stochastic linear variational inequality problems whose first stage problems are stochastic linear box-constrained variational inequality problems and second stage problems are stochastic linear complementary problems having a unique solution. We first give conditions for the existence of solutions to both the original problem and its perturbed problems. Next we derive quantitative stability assertions of this two-stage stochastic problem under total variation metrics via the corresponding residual function. Moreover, we study the discrete approximation problem. The convergence and the exponential rate of convergence of optimal solution sets are obtained under moderate assumptions respectively. Finally, through solving a non-cooperative game in which each player’s problem is a parameterized two-stage stochastic program, we numerically illustrate our theoretical results.

Suggested Citation

  • Jie Jiang & Xiaojun Chen & Zhiping Chen, 2020. "Quantitative analysis for a class of two-stage stochastic linear variational inequality problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 431-460, June.
    • Handle: RePEc:spr:coopap:v:76:y:2020:i:2:d:10.1007_s10589-020-00185-z
    DOI: 10.1007/s10589-020-00185-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00185-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-020-00185-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jinlong Lei & Uday V. Shanbhag & Jong-Shi Pang & Suvrajeet Sen, 2020. "On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 157-190, February.
    2. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    3. Stephen M. Robinson, 1980. "Strongly Regular Generalized Equations," Mathematics of Operations Research, INFORMS, vol. 5(1), pages 43-62, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhen-Ping Yang & Gui-Hua Lin, 2021. "Variance-Based Single-Call Proximal Extragradient Algorithms for Stochastic Mixed Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 393-427, August.
    2. Jie Jiang & Hailin Sun, 2023. "Monotonicity and Complexity of Multistage Stochastic Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 433-460, February.
    3. Jie Jiang & Shengjie Li, 2021. "Regularized Sample Average Approximation Approach for Two-Stage Stochastic Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 650-671, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. Durea & R. Strugariu, 2011. "On parametric vector optimization via metric regularity of constraint systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 409-425, December.
    2. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    3. Fan, Yingjie & Schwartz, Frank & Voß, Stefan, 2017. "Flexible supply chain planning based on variable transportation modes," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 654-666.
    4. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    5. Andreatta, Giovanni & Dell'Olmo, Paolo & Lulli, Guglielmo, 2011. "An aggregate stochastic programming model for air traffic flow management," European Journal of Operational Research, Elsevier, vol. 215(3), pages 697-704, December.
    6. Huang, Edward & Mital, Pratik & Goetschalckx, Marc & Wu, Kan, 2016. "Optimal assignment of airport baggage unloading zones to outgoing flights," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 110-122.
    7. Hu, Shaolong & Han, Chuanfeng & Dong, Zhijie Sasha & Meng, Lingpeng, 2019. "A multi-stage stochastic programming model for relief distribution considering the state of road network," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 64-87.
    8. Zhicheng Zhu & Yisha Xiang & Bo Zeng, 2021. "Multicomponent Maintenance Optimization: A Stochastic Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 898-914, July.
    9. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.
    10. Fadda, Edoardo & Manerba, Daniele & Cabodi, Gianpiero & Camurati, Paolo Enrico & Tadei, Roberto, 2021. "Comparative analysis of models and performance indicators for optimal service facility location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    11. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    12. Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva, 2019. "Newton’s method with feasible inexact projections for solving constrained generalized equations," Computational Optimization and Applications, Springer, vol. 72(1), pages 159-177, January.
    13. Riis, Morten & Andersen, Kim Allan, 2005. "Applying the minimax criterion in stochastic recourse programs," European Journal of Operational Research, Elsevier, vol. 165(3), pages 569-584, September.
    14. Alexander Franz & Julia Rieck & Jürgen Zimmermann, 2019. "Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages," Annals of Operations Research, Springer, vol. 274(1), pages 241-265, March.
    15. Guo, Zhaomiao & Fan, Yueyue, 2017. "A Stochastic Multi-Agent Optimization Model for Energy Infrastructure Planning Under Uncertainty and Competition," Institute of Transportation Studies, Working Paper Series qt89s5s8hn, Institute of Transportation Studies, UC Davis.
    16. Davi Valladão & Thuener Silva & Marcus Poggi, 2019. "Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns," Annals of Operations Research, Springer, vol. 282(1), pages 379-405, November.
    17. Gyana R. Parija & Shabbir Ahmed & Alan J. King, 2004. "On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 73-83, February.
    18. Nguyen Qui, 2014. "Stability for trust-region methods via generalized differentiation," Journal of Global Optimization, Springer, vol. 59(1), pages 139-164, May.
    19. Yingjie Fan & Frank Schwartz & Stefan Voß & David L. Woodruff, 2017. "Stochastic programming for flexible global supply chain planning," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 601-633, December.
    20. R. Fourer & H. Gassmann & J. Ma & R. Martin, 2009. "An XML-based schema for stochastic programs," Annals of Operations Research, Springer, vol. 166(1), pages 313-337, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:76:y:2020:i:2:d:10.1007_s10589-020-00185-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.