A NEW DUAL PROBLEM FOR NONDIFFERENTIABLE CONVEX PROGRAMMING

被引:0
|
作者
李师正 [1 ]
机构
[1] Shandong Normal University
关键词
MD; MP; A NEW DUAL PROBLEM FOR NONDIFFERENTIABLE CONVEX PROGRAMMING;
D O I
暂无
中图分类号
学科分类号
摘要
This paper gives a new dual problem for nondifferentiable convex programming and provesthe properties of weak duality and strong duality and offers a necessary and sufficient condition ofstrong duality.
引用
收藏
页码:370 / 372
页数:3
相关论文
共 50 条