On necessary conditions for a class of nondifferentiable minimax fractional programming
β Scribed by H.Z. Luo; H.X. Wu
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 181 KB
- Volume
- 215
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
The Kuhn-Tucker-type necessary optimality conditions are given for the problem of minimizing a max fractional function, where the numerator of the function involved is the sum of a differentiable function and a convex function while the denominator is the difference of a differentiable function and a convex function, subject to a set of differentiable nonlinear inequalities on a convex subset C of R n , under the conditions similar to the Kuhn-Tucker constraint qualification or the Arrow-Hurwicz-Uzawa constraint qualification or the Abadie constraint qualification. Relations with the calmness constraint qualification are given.
π SIMILAR VOLUMES
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