.png){kind=icon}
返回
Multiobjective programming under d-invexity
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00092-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a generalization of convexity is considered in the case of nonlinear multiobjective programming problem where the functions involved are nondifferentiable. By considering the concept of Pareto optimal solution and substituting d-invexity for convexity, the Fritz John type and Karush-Kuhn-Tucker type necessary optimality conditions and duality in the sense of Mond-Weir and Wolfe for nondifferentiable multiobjective programming are given. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
multiobjective programming
(weak) Pareto optimal solution
d-invex function with respect to eta
optimality conditions
duality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
7.3W
机构
暂无机构信息
引用论文
分享收藏Phyletic Considerations of the Harpellales and Asellariales (Trichomycetes, Zygomycotina) and the Kickxellales (Zygomycetes, Zygomycotina).png)
Mycologia
MycologiaIF0
PREAI
分享收藏
查看更多内容