Under different forms of invexity conditions, sufficient Kuhn᎐Tucker conditions and three dual models are presented for the minimax fractional programming.
On Minimax Fractional Optimality Conditions with (F, ρ)-Convexity
✍ Scribed by J.C Liu; C.S Wu
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 186 KB
- Volume
- 219
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
✦ Synopsis
We establish the sufficient conditions for generalized fractional programming in Ž . the framework of F, -convex functions. When the sufficient conditions are utilized, one parametric dual problem and two parametric free dual problems may be formulated and duality results are derived.
📜 SIMILAR VOLUMES
In this paper, we establish some sufficient conditions under which a feasible solution of such a problem will be Pareto optimal provided that a weaker convexity requirement is satisfied; for Ž . instance ᑣ, , -convexity is assumed for both objective and constraint set functions. Some duality models
The concept of efficiency pareto optimum is used to formulate duality for multiobjective variational control problems. Wolfe and Mond᎐Weir type duals are Ž . formulated. Under the generalized F y -convexity on the functions involved, weak and strong duality theorems are proved.