Fritz John second-order duality for nonlinear programming

被引：6
|
作者：
Husain, I [1 ]
Rueda, NG
Jabeen, Z
机构：
[1] Reg Engineer Coll, Dept Math, Srinagar 190006, Jammu & Kashmir, India
[2] Merrimack Coll, Dept Math, N Andover, MA 01845 USA
来源：
APPLIED MATHEMATICS LETTERS | 2001年 / 14卷 / 04期
关键词：
Bonvex; Fritz John second-order duality; Pseudobonvex; Semi-strictly pseudobonvez; Strictly pseudobonvex;
D O I：
10.1016/S0893-9659(00)00186-5
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A second-order dual to a nonlinear programming problem is formulated. This dual uses the Fritz John necessary optimality conditions instead of the Karush-Kuhn-Tucker necessary optimality conditions, and thus, does not require a constraint qualification. Weak, strong, strict-converse, and converse duality theorems between primal and dual problems are established. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：513 / 518
页数：6
相关论文
共 50 条
12345