Duality in non-linear programming

被引:0
|
作者
Jeyalakshmi, K. [1 ]
机构
[1] SRM Inst Sci & Technol, Dept Math, Fac Engn & Technol, Madras 603203, Tamil Nadu, India
关键词
D O I
10.1088/1742-6596/1000/1/012163
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper we consider duality and converse duality for a programming problem involving convex objective and constraint functions with finite dimensional range. We do not assume any constraint qualification. The dual is presented by reducing the problem to a standard Lagrange multiplier problem.
引用
收藏
页数:4
相关论文
共 50 条