Set-valued minimax programming problems under generalized cone convexity

Das, Koushik; Nahak, C.

doi:10.1007/s12215-016-0258-6

Cited by 10 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Das and Nahak [5,6,7,8,9,10,11,12,13,14,15] introduced the notion of ρ-cone convex set-valued maps. They establish the sufficient KKT conditions and study the duality results for various types of set-valued optimization problems under contingent epiderivative and ρ-cone convexity assumptions.…”

Section: Resultsmentioning

confidence: 99%

Set-valued optimization problems via second-order contingent epiderivative

Das¹,

Nahak

2021

YUGOSLAV J OPERATION

View full text Add to dashboard Cite

show abstract

Section: Resultsmentioning

confidence: 99%

Set-valued optimization problems via second-order contingent epiderivative

Das¹,

Nahak

2021

YUGOSLAV J OPERATION

View full text Add to dashboard Cite

show abstract

“…Das and Nahak [4,5,6,7,8,9,10,11,12,13,14,15] introduced the notion of ρ-cone convex set-valued maps. They establish the sufficient KKT conditions and study the duality results for various types of set-valued optimization problems under contingent epiderivative and ρ-cone convexity assumptions.…”

Section: Resultsmentioning

confidence: 99%

Parametric Set-Valued Optimization Problems Under Generalized Cone Convexity

Das¹,

Nahak²

2021

Jnanabha

View full text Add to dashboard Cite

show abstract

“…The typical notion of cone convex SVMs, introduced by Borwein [6], is what it diminishes to for σ = 0. They [15] also established the optimality conditions for SVMPPs and duality results. By proposing the concept of higher-order σ-cone arcwisely connectedness of SVMs as a generalization of higher-order cone arcwisely connected SVMs, we accumulate sufficient optimality criteria for SVOPs.…”

Section: Definition 210 [22]mentioning

confidence: 99%

Set-valued minimax programming problems under higher-order σ-arcwisely connectivity

DAS

2023

Preprint

View full text Add to dashboard Cite

In this work, a set-valued minimax programming problem (MP) is taken into account. In the broad sense of higher-order arcwisely connected set-valued maps, we introduce the concept of higher-order σ-arcwisely connectedness of set-valued maps. Under higher-order contingent epidifferentiation and higher-order σ-arcwisely connectivity suppositions, the higher-order sufficient criteria for Karush-Kuhn-Tucker (KKT) optimality are constructed for the problem (MP). Additionally, we develop the higher-order Mond-Weir, Wolfe, and mixed kinds of duality and demonstrate the higher-order strong, weak, and converse theorems of duality among our main problem (MP) and the associated duals under higher-order σ-arcwisely connectivity supposition. Mathematics Subject Classification (2000) 26B25 · 49N15

show abstract

Set-valued minimax programming problems under generalized cone convexity

Cited by 10 publications

References 13 publications

Set-valued optimization problems via second-order contingent epiderivative

Set-valued optimization problems via second-order contingent epiderivative

Parametric Set-Valued Optimization Problems Under Generalized Cone Convexity

Set-valued minimax programming problems under higher-order σ-arcwisely connectivity

Contact Info

Product

Resources

About