Set-valued minimax programming problems under $ \sigma $-arcwisely connectivity-Reference-Cited by-同舟云学术

Set-valued minimax programming problems under $ \sigma $-arcwisely connectivity

Published:2023 Issue:5 Volume:8 Page:11238-11258
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

Das Koushik¹,Treanţă Savin²³⁴,Botmart Thongchai⁵

Affiliation:

1. Department of Mathematics, Taki Government College, Taki 743429, India

2. Department of Applied Mathematics, University Politehnica of Bucharest, Bucharest 060042, Romania

3. Academy of Romanian Scientists, 54 Splaiul Independentei, Bucharest 050094, Romania

4. "Fundamental Sciences Applied in Engineering" Research Center (SFAI), University Politehnica of Bucharest, Bucharest 060042, Romania

5. Department of Mathematics, Faculty of Science, Khon Kaen University, Khoon Kaen 40002, Thailand

Abstract

<abstract><p>A set-valued minimax programming problem (in short, SVMP) is taken into consideration in this study. We present the idea of $ \sigma $-arcwisely connectivity of set-valued maps (in short, SVM) in the broader sense of arcwisely connected SVMs. The sufficient criteria for Karush-Kuhn-Tucker (KKT) optimality are constituted for the problem (MP) under contingent epidifferentiation and $ \sigma $-arcwisely connectivity suppositions. In addition, we develop the Mond-Weir (MWD), Wolfe (WD), and mixed (MD) kinds models of duality and verify the associated strong, weak, and converse theorems of duality among the primal (MP) and the associated figures of duals under $ \sigma $-arcwisely connectivity supposition.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Reference30 articles.

1. J. P. Aubin, Contingent derivatives of set-valued maps and existence of solutions to nonlinear inclusions and differential inclusions, In: Mathematical analysis and applications, Part A, New York: Academic Press, 1981,160–229.

2. J. P. Aubin, H. Frankowska, Set-valued analysis, Boston: Birhäuser, 1990.

3. M. Avriel, Nonlinear programming: theory and method, Englewood Cliffs, New Jersey: Prentice-Hall, 1976.

4. C. R. Bector, B. L. Bhatia, Sufficient optimality conditions and duality for a minmax Ž. problem, Utilitas Math., 27 (1985), 229–247.

5. C. R. Bector, S. Chandra, I. Husain, Sufficient optimality conditions and duality for a continuous-time minmax programming problem, Asia-Pac. J. Oper. Res., 9 (1992), 55–76.