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
Fritz-John Optimality and Duality for Non-convex Programs
โ Scribed by Vinod Lyall; S.K. Suneja; Sunila Aggarwal
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 189 KB
- Volume
- 212
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
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 are continuous. A Mond-Weir type dual is associated and weak and strong duality results are established by assuming the functions involved to be locally P-connected. These results are further extended and necessary as well as sufficient optimality conditions are obtained for a weakly efficient solution of a multiobjective non-linear program. A proper weak minimum is defined and duality results are established by using this concept.
๐ SIMILAR VOLUMES
We consider a multiobjective fractional programming problem MFP involving vector-valued objective n-set functions in which their numerators are different from each other, but their denominators are the same. By using the concept of proper efficiency, we establish optimality conditions and duality re
Various types of sufficient conditions of optimality for non-linear optimal control problems with delays in state and control variables are formulated. The involved functions are not required to be convex. A secondorder sufficient condition is shown to be related to the existence of solutions of a R
Using a parametric approach, we establish necessary and sufficient conditions and derive duality theorems for a class of nonsmooth generalized minimax fractional programming problems containing pseudoinvex functions.
In this paper, we consider a class of nonsmooth multiobjective fractional programming problems in which functions are locally Lipschitz. We establish generalized Karush-Kuhn-Tucker necessary and sufficient optimality conditions and derive duality theorems for nonsmooth multiobjective fractional prog