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
An optimality condition for a nondifferentiable convex program
β Scribed by Henry Wolkowicz
- Publisher
- John Wiley and Sons
- Year
- 1983
- Tongue
- English
- Weight
- 155 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π 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
In this paper, both the Wolfe type and MondαWeir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established