Temat: contingent epiderivative - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Contingent epiderivative and its applications to set-valued optimization
Autorzy:: Bednarczuk, E.
Song, W.
Powiązania:: https://bibliotekanauki.pl/articles/206559.pdf
Data publikacji:: 1998
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: optymalizacja wektorowa
contingent epiderivative
optimality conditions
sensitivity analysis
vector optimization
Opis:: In the present paper we give an alternative definition of contingent epiderivative for a set-valued map. We use our concept of contingent epiderivative to formulate necessary and/ or sufficient optimality conditions for a set-valued optimization problem and to study sensivity of a family of parametrized vector optimization problems.
Źródło:: Control and Cybernetics; 1998, 27, 3; 375-386
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Set-valued minimax fractional programming problems under -cone arcwise connectedness
Autorzy:: Das, Koushik
Powiązania:: https://bibliotekanauki.pl/articles/2183488.pdf
Data publikacji:: 2022
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: convex cone
set-valued map
contingent epiderivative
arcwise connectedness
duality
Opis:: In this paper, we consider a set-valued minimax fractional programming problem (MFP), where the objective as well as constraint maps are set-valued. We introduce the notion of ρ- cone arcwise connectedness of set-valued maps as a generalization of cone arcwise connected set-valued maps. We establish the sufficient Karush-Kuhn-Tucker (KKT) conditions for the existence of minimizers of the problem (MFP) under ρ-cone arcwise connectedness assumption. Further, we study the Mond-Weir (MWD), Wolfe (WD), and mixed (MD) types of duality models and prove the corresponding weak, strong, and converse duality theorems between the primal (MFP) and the corresponding dual problems under ρ-cone arcwise connectedness assumption.
Źródło:: Control and Cybernetics; 2022, 51, 1; 43--69
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja