Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  efficient solution
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this paper, we consider the class of nondifferentiable multiobjective fractional variational control problems involving the nondifferentiable terms in the numerators and in the denominators. Under univexity and generalized univexity hypotheses, we prove optimality conditions and various duality results for such nondifferentiable multiobjective fractional variational control problems. The results established in the paper generalize many similar results established earlier in the literature for such nondifferentiable multiobjective fractional variational control problems.
EN
This paper deals with a robust multiobjective optimization problem involving nonsmooth/nonconvex real-valued functions. Under an appropriate constraint qualification, we establish necessary optimality conditions for weakly robust efficient solutions of the considered problem. These optimality conditions are presented in terms of Karush-Kuhn-Tucker multipliers and convexificators of the related functions. Examples illustrating our findings are also given.
EN
In this paper, we generalize the notion of B-(p, r)-invexity introduced by Antczak in [A class of B-(p; r)-invex functions and mathematical programming, J. Math. Anal. Appl. 286 (2003), 187–206] for scalar optimization problems to the case of a multiobjective variational programming control problem. For such nonconvex vector optimization problems, we prove sufficient optimality conditions under the assumptions that the functions constituting them are B-(p, r)-invex. Further, for the considered multiobjective variational control problem, its dual multiobjective variational control problem in the sense of Mond-Weir is given and several duality results are established under B-(p, r)-invexity.
4
Content available remote Multiobjective variational programming under generalized (V, p)-B-type I functions
EN
In this paper, we generalize the (V, p)-invexity denned for nonsmooth multiobjective fractional programming by Mishra, Rueda and Giorgi (2003) to variational programming problems by defining new classes of vector- valued functions called (V, p)-B-type I and generalized (V, p)-B-type I. Then we use these new classes to derive various sufficient optimality conditions and mixed type duality results.
EN
A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.
EN
In this paper, we consider the multiobjective variational problem. We propose a class of generalized B-type I vector-valued functions and use this concept to establish sufficient optimality conditions and mixed type duality results
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.