In this paper we study the saddle point optimality conditions and Lagrange duality in multiobjective optimization for generalized subconvex-like functions. We obtain results which will allow us to characterize the solutions for multiobjective programming problems from the saddle point conditions and
On Second-Order Symmetric Duality in Nondifferentiable Programming
β Scribed by S.H. Hou; X.M. Yang
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 70 KB
- Volume
- 255
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
β¦ Synopsis
This article is concerned with a pair of second-order symmetric dual non-differentiable programs and second-order F-pseudo-convexity. We establish the weak and the strong duality theorems for the new pair of dual models under the F-pseudo-convexity assumption. Several known results including Mond and Schechter, as well as others are obtained as special cases.
π SIMILAR VOLUMES
An incomplete Lagrange function is introduced for a class of nonlinear programming problems which explains the reason behind the construction of the MondαWeirαtype dual. A mixed-type dual is presented for a class of fractional and generalized fractional programming problems, and various duality theo
In this paper, we introduce the concepts of higher-order type-I, pseudo-type-I, and quasi-type-I functions and establish various higher-order duality results involving these functions.