| 非可微凸规划的对偶问题 |
| |
| 引用本文： | 李师正,张玉芬.非可微凸规划的对偶问题[J].运筹与管理,1999,8(2):1-5. |
| |
| 作者姓名： | 李师正 张玉芬 |
| |
| 作者单位： | 山东师范大学数学研究所 |
| |
| 摘 要： | 文章建立关于非可微凸规划的一个新的对偶问题，它不同于已知的对偶问题，文中证明了弱对偶性及强对偶性。并用Ｌａｇｒａｎｇｅ正则性证明了强对偶性的充要条件。最后，讨论了等式约束的情况。
|
| 关 键 词： | Lagrange正则性 弱对偶性 强对偶性 |
A Dual Problem for Nondifferentiable Convex Programming |
| |
| LI Shi zheng,ZHANG Yu fen.A Dual Problem for Nondifferentiable Convex Programming[J].Operations Research and Management Science,1999,8(2):1-5. |
| |
| Authors: | LI Shi zheng ZHANG Yu fen |
| |
| Abstract: | In this paper,we set up a new dual problem for nondifferentiable convex programming which is different from well known dual problems and prove the weak duality and the strong duality. We give the necessary and sufficient condition of strong duality by using Lagrangian regularity. Finally,the case of equality constrainte is considered. |
| |
| Keywords: | lagrangian regularity weak duality strong duality |
| 本文献已被 CNKI 维普 等数据库收录！ |
