.png){kind=icon}
返回
Symmetric duality for minimax multiobjective variational mixed integer programming problems with partial-invexity
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.04.045.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A pair of symmetric dual multiobjective variational mixed integer programs for the polars of arbitrary cones are formulated, which some primal and dual variables are constrained to belong to the set of integers. Under the separability with respect to integer variables and partial-invexity assumptions on the functions involved, we prove the weak, strong, converse and self-duality theorems to related minimax efficient solution. These results include some of available results. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
multiobjective variational problems
mixed integer programming
symmetric duality
self-duality
partial-invexity
closed convex cone
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Human Gait Recognition for Biometrics Application Based on Deep Learning Fusion Assisted Framework
OAAI
OAAI分享收藏
查看更多内容