...
首页> 外文期刊>Operations Research Letters: A Journal of the Operations Research Society of America >A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
【24h】

A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials

机译:一种混合方法,用于使用SOS-凸多项式寻找载体优化中的高效解决方案

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

摘要

This paper aims to find efficient solutions to a vector optimization problem (VOP) with SOS-convex polynomials. A hybrid scalarization method is used to transform (VOP) into a scalar one. A strong duality result, between the proposed scalar problem and its relaxation dual problem, is established, under certain regularity condition. Then, an optimal solution to the proposed scalar problem can be found by solving its associated semidefinite programming problem. Consequently, we observe that finding efficient solutions to (VOP) can be achieved. (C) 2020 Published by Elsevier B.V.
机译:本文旨在通过SOS-Convex多项式找到对向量优化问题(VOP)的有效解决方案。 混合标准化方法用于将(VOP)转换为标量。 在某些规则性条件下建立了强大的二元性结果,在建议的标量问题与其放松双问题之间。 然后,可以通过解决其相关的SEMIDEFINITE编程问题来找到提出的标量问题的最佳解决方案。 因此,我们观察到能够实现对(VOP)的有效解决方案。 (c)2020由elsevier b.v发布。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号