On Minimax Fractional Programming of Generalized Convex Set Functions
β Scribed by H.C. Lai; J.C. Liu
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 165 KB
- Volume
- 244
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π 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
Let f be a continuous convex function on a Banach space E. This paper shows that every proper convex function g on E with g F f is generically Frechet differentiable if and only if the image of the subdifferential map Ρ¨ f of f has the RadonαNikodym property, and in this case it is equivalent to show
Uncertainty has been treated in science for several decades. It always exists in real systems. Probability has been traditionally used in modeling uncertainty. Belief and plausibility functions based on the Dempster-Shafer theory ~DST! become another method of measuring uncertainty, as they have bee