Fritz john second-order duality for nonlinear programming
β Scribed by I. Husain; N.G. Rueda; Z. Jabeen
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 368 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
β¦ Synopsis
A second-order dual to a nonlinear programming problem is formulated. This dual uses the Ritz John necessary optimality conditions instead of the Karush-Kuhn-Tucker necessary optimal&y conditions, and thus, does not require a constraint qualification. Weak, strong, strictconverse, and converse duality theorems between primal and dual problems are established.
π SIMILAR VOLUMES
In this paper we have obtained Fritz-John type necessary optimality criteria for non-linear programs under the hypotheses that the right differentials, at the optimal point, of the objective and the active constraint functions with respect to an arc are convex and the inactive constraint functions a
## pair of second-order symmetric dual models for multiobJective nonlinear programmmg 1s proposed m this paper We prove the weak, strong, and converse duality theorems for the formulated second-order symmetric dual programs under mvexity condltlons