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 an
Second-order duality in nondifferentiable fractional programming
β Scribed by I. Ahmad; Z. Husain; S. Al-Homidan
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 227 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1468-1218
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Two types of second-order dual models are formulated for a nondifferentiable minmax programming problem and usual duality results are established involving generalized type-I functions.
Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of complex nondifferentiable fractional programming problems containing generalized convex functions. Subsequently, these optimality criteria are utilized as a basis for constructing one para
We introduce the nondifferentiable multiobjective problem involving cone constraints, where every component of the objective function contains a term involving the support function of a compact convex set. For this problem, Wolfe and Mond-Weir type duals are proposed. We establish weak, strong duali
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