Duality for nondifferentiable minimax programming in complex spaces
β Scribed by Hang-Chin Lai; Jen-Chwan Liu
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 326 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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