A Non-differentiable Programming Problem under Strong Pseudoinvexity

被引：0
|
作者：
A. Kumar
S. Ghosh
机构：
[1] National Institute of Technology,Department of Mathematics
来源：
OPSEARCH | 2003年 / 40卷 / 4期
关键词：
D O I：
10.1007/BF03398703
中图分类号：
学科分类号：
摘要：
A special class of nonlinear non differentiable programming problem containing square root term in the objective function as well as in the constraints is considered. Necessary and sufficient conditions of optimality are given under strong pseudoinvexity assumption on the functions involved. These conditions are then used to establish duality theorems.
引用
收藏
页码：299 / 304
页数：5
相关论文
共 50 条
12345