...
首页> 外文期刊>Mathematical Programming >Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
【24h】

Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization

机译:通过逼近求解具有平衡约束的随机数学程序,并通过惩罚平滑隐式程序

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we consider the stochastic mathematical programs with linear complementarity constraints, which include two kinds of models called here-and-now and lower-level wait-and-see problems. We present a combined smoothing implicit programming and penalty method for the problems with a finite sample space. Then, we suggest a quasi-Monte Carlo approximation method for solving a problem with con_tinuous random variables. A comprehensive convergence theory is included as well. We further report numerical results with the so-called picnic vender decision problem.
机译:在本文中,我们考虑具有线性互补约束的随机数学程序,该程序包括两种模型,分别称为“今时今日”和“较低级别的观望问题”。对于有限样本空间的问题,我们提出了一种组合的平滑隐式编程和惩罚方法。然后,我们提出了一种准蒙特卡罗近似方法来解决连续随机变量连续的问题。还包括一个全面的收敛理论。我们进一步报告了带有所谓野餐供应商决策问题的数值结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号