Zobrazeno 1 - 10
of 43
pro vyhledávání: '"DAISHI KUROIWA"'
Publikováno v:
Operations Research Perspectives, Vol 5, Iss , Pp 113-119 (2018)
The question we address is how robust solutions react to changes in the uncertainty set. We prove the location of robust solutions with respect to the magnitude of a possible decrease in uncertainty, namely when the uncertainty set shrinks, and conve
Externí odkaz:
https://doaj.org/article/09d41077558845c8a149991c8026a322
Autor:
Ryohei Harada, Daishi Kuroiwa
Publikováno v:
Journal of Inequalities and Applications, Vol 2016, Iss 1, Pp 1-15 (2016)
Abstract In this paper, we provide Lagrange-type duality theorems for mathematical programming problems with DC objective and constraint functions. The class of problems to which Lagrange-type duality theorems can be applied is broader than the class
Externí odkaz:
https://doaj.org/article/61f3ddd48124414f8c6b69660d0949b5
Autor:
PORNPIMON BORIWAN1 boriwanp_1990@hotmail.com, DAISHI KUROIWA2 kuroiwa@riko.shimane-u.ac.jp, NARIN PETROT1,3 narinp@nu.ac.th
Publikováno v:
Carpathian Journal of Mathematics. 2022, Vol. 38 Issue 1, p57-66. 10p.
Publikováno v:
Carpathian Journal of Mathematics. 37:417-426
This study provides the important properties of the lexicographic tolerable robust solution for uncertain multi-objective optimization problems which was introduced by Boriwan et al. [Boriwan, P.; Ehrgott, M.; Kuroiwa, D.; Petrot, N. The lexicographi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f36f4638eaa84c4ba586741d1edf668e
https://doi.org/10.37193/cjm.2021.03.05
https://doi.org/10.37193/cjm.2021.03.05
Publikováno v:
Sustainability, Vol 12, Iss 7582, p 7582 (2020)
Sustainability
Volume 12
Issue 18
Sustainability
Volume 12
Issue 18
In this study, we introduce a robust solution concept for uncertain multi-objective optimization problems called the lexicographic tolerable robust solution. This approach is advantageous for the practical implementation of problems in which the solu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::567a7dabaf03a90d5bef4730b2e5d726
https://www.mdpi.com/2071-1050/12/18/7582
https://www.mdpi.com/2071-1050/12/18/7582
Autor:
Satoshi Suzuki, Daishi Kuroiwa
Publikováno v:
SN Operations Research Forum. 1
In mathematical programming, duality theorems play a central role. Especially, in convex and quasiconvex programming, Lagrange duality and surrogate duality have been studied extensively. Additionally, constraint qualifications are essential ingredie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffb8451b7417a334c21c8406c5bfec9b
http://ir.lib.shimane-u.ac.jp/48941
http://ir.lib.shimane-u.ac.jp/48941
Publikováno v:
Optimization. 67:1077-1094
In this paper, we study different classes of generalized convex/quasiconvex set-valued maps, defined by means of the l-type and u-type preorder relations, currently used in set-valued optimization....
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2bb1d4b78e72f30991d739565d7ad939
https://doi.org/10.1080/02331934.2018.1454920
https://doi.org/10.1080/02331934.2018.1454920
Publikováno v:
Operations Research Perspectives, Vol 5, Iss, Pp 113-119 (2018)
The question we address is how robust solutions react to changes in the uncertainty set. We prove the location of robust solutions with respect to the magnitude of a possible decrease in uncertainty, namely when the uncertainty set shrinks, and conve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::611369dda6ee881c499e067bbcf3d4a5
http://ir.lib.shimane-u.ac.jp/53214
http://ir.lib.shimane-u.ac.jp/53214
Autor:
Satoshi Suzuki, Daishi Kuroiwa
Publikováno v:
Optimization letters. 11(8):1699-1712
Characterizations of the solution set in terms of subdifferentials play an important role in research of mathematical programming. Previous characterizations are based on necessary and sufficient optimality conditions and invariance properties of sub
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c67bafe0f9064165160db92dce4f85b0
http://ir.lib.shimane-u.ac.jp/40664
http://ir.lib.shimane-u.ac.jp/40664
Autor:
Daishi Kuroiwa, Satoshi Suzuki
Publikováno v:
Journal of optimization theory and applications. 172(2):669-683
In the research of mathematical programming, duality theorems are essential and important elements. Recently, Lagrange duality theorems for separable convex programming have been studied. Tseng proves that there is no duality gap in Lagrange duality
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d66a82a3edad57bd02817c20ece0315b
http://ir.lib.shimane-u.ac.jp/38368
http://ir.lib.shimane-u.ac.jp/38368