Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Krishna Kummari"'
Publikováno v:
International Journal of Analysis and Applications, Vol 18, Iss 5, Pp 784-798 (2020)
In this paper, we are concerned with one of the difficult class of optimization problems called the interval-valued optimization problem with vanishing constraints. Sufficient optimality conditions for a LU optimal solution are derived under generali
Externí odkaz:
https://doaj.org/article/9873cf731d3443159a1648c1a840c7c5
Publikováno v:
Mathematics, Vol 10, Iss 11, p 1787 (2022)
In this paper, Karush-Kuhn-Tucker type robust necessary optimality conditions for a robust nonsmooth interval-valued optimization problem (UCIVOP) are formulated using the concept of LU-optimal solution and the generalized robust Slater constraint qu
Externí odkaz:
https://doaj.org/article/c3f98e95e97c4ccaadc1e3cdeb57958c
Autor:
Vivekananda Rayanki, Krishna Kummari
Publikováno v:
Yugoslav Journal of Operations Research. 33:199-231
In this paper a special kind of variational programming problem involving fractional interval-valued objective function is considered. For such type of problem, insights into LU optimal solutions have been discussed. Using the LU optimal concept, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3fc9ff5432981507a966214aba5f4dc
https://doi.org/10.2298/yjor210815028r
https://doi.org/10.2298/yjor210815028r
Autor:
B. Japamala Rani, Krishna Kummari
Publikováno v:
OPSEARCH. 60:481-500
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ee881f0ca850228e81af2b8a61850bd
https://doi.org/10.1007/s12597-022-00617-w
https://doi.org/10.1007/s12597-022-00617-w
Publikováno v:
Journal of the Operations Research Society of China.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83f730a35437a7229d22bc98e2d016a6
https://doi.org/10.1007/s40305-021-00381-6
https://doi.org/10.1007/s40305-021-00381-6
Publikováno v:
Mathematics; Volume 10; Issue 11; Pages: 1787
In this paper, Karush-Kuhn-Tucker type robust necessary optimality conditions for a robust nonsmooth interval-valued optimization problem (UCIVOP) are formulated using the concept of LU-optimal solution and the generalized robust Slater constraint qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fe89489b94489c914b1271432a4d71f
https://doi.org/10.3390/math10111787
https://doi.org/10.3390/math10111787
Publikováno v:
Numerical Functional Analysis and Optimization. 38:926-950
In this paper, we introduce the concept of higher-order (Φ, ρ)-V-invexity and present two types of higher-order dual models for a semi-infinite minimax fractional programming problem. Weak, strong, and strict converse duality theorems are discussed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94dee1bafee775011e68f66fe91e95a0
https://doi.org/10.1080/01630563.2017.1301468
https://doi.org/10.1080/01630563.2017.1301468
Publikováno v:
OPSEARCH. 54:598-617
In this paper, we present new class of higher-order \((C, \alpha , \rho , d)\)-convexity and formulate two types of higher-order duality for a nondifferentiable minimax fractional programming problem. Based on the higher-order \((C, \alpha , \rho , d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2e5eb344b51a51c958a96750b83073d
https://doi.org/10.1007/s12597-016-0295-0
https://doi.org/10.1007/s12597-016-0295-0
Publikováno v:
Filomat. 31:4555-4570
The aim of this work is to study optimality conditions for nonsmooth minimax programming problems involving locally Lipschitz functions by means of the idea of convexifactors that has been used in [J. Dutta, S. Chandra, Convexifactors, generalized co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b0b3a762c54d464637671331abceb67
https://doi.org/10.2298/fil1714555a
https://doi.org/10.2298/fil1714555a
Autor:
Anurag Jayswal, Krishna Kummari
Publikováno v:
Georgian Mathematical Journal. 23:367-380
The purpose of this paper is to study a nondifferentiable minimax semi-infinite programming problem in a complex space. For such a semi-infinite programming problem, necessary and sufficient optimality conditions are established by utilizing the inve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c3393c45495f108203d4c3be137160a
https://doi.org/10.1515/gmj-2016-0001
https://doi.org/10.1515/gmj-2016-0001