...
首页> 外文期刊>International Journal of Pure and Applied Sciences and Technology >A Decomposition Algorithm for Solving Chance Constrain Bi Level Multi Objective Large Scale Quadratic Programming Problem
【24h】

A Decomposition Algorithm for Solving Chance Constrain Bi Level Multi Objective Large Scale Quadratic Programming Problem

机译:求解机会约束双向多目标大规模二次规划问题的分解算法

获取原文
   

获取外文期刊封面封底 >>

       

摘要

This paper solves a bi-level multi objective large scale quadratic programming problem with stochastic parameters in the constraints (SBLMOLSQPP). We solve this problem usingan algorithm that begins with transforming the probabilistic nature to equivalent deterministic of this problem, thenTaylor series is used to overcome the complexity of the quadratic problem. Finally, an illustrative numerical example is given to clarify the developed theory.
机译:该文解决了约束中具有随机参数的双层多目标大规模二次规划问题(SBLMOLSQPP)。我们使用从将概率性质转换为该问题的等价确定性开始的算法来解决此问题,然后使用泰勒级数来克服二次问题的复杂性。最后,给出了一个说明性的数值示例来阐明已发展的理论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号