首页> 外文会议>The 8th international conference on optimization: Techniques and Applications >Relaxed Cutting Plane Method with Convexification to Solve Nonlinear Semi-Infinite Programming Problems
【24h】

Relaxed Cutting Plane Method with Convexification to Solve Nonlinear Semi-Infinite Programming Problems

机译:凸松弛割平面法求解非线性半无限规划问题。

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

摘要

We present an algorithm to solve the nonlinear semi-infinite programming problem (NSIP) in this paper. To deal with the nonlinear constraint, we use the u000bBB method, which has been used widely in global optimization, to construct numerous concave functions to approximate the nonlinear constraint function.
机译:本文提出了一种解决非线性半无限规划问题的算法。为了处理非线性约束,我们使用已在全局优化中广泛使用的u000bBB方法构造许多凹函数来逼近非线性约束函数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号