IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v182y2019i3d10.1007_s10957-019-01496-w.html
   My bibliography  Save this article

Dual Approaches to Characterize Robust Optimal Solution Sets for a Class of Uncertain Optimization Problems

Author

Listed:
  • Xiangkai Sun

    (Chongqing Technology and Business University)

  • Kok Lay Teo

    (Curtin University)

  • Liping Tang

    (Chongqing Technology and Business University)

Abstract

In this paper, we deal with robust optimal solution sets for a class of optimization problems with data uncertainty in both the objective and constraints. We first introduce a mixed-type robust dual problem of this class of uncertain optimization problems and explore robust strong duality relations between them. Then, we propose a new approach to characterize robust optimal solution sets of this class of uncertain optimization problems via its dual problem. Moreover, we show that several results on characterizations of robust optimal solution sets of uncertain optimization problems obtained in recent literature can be obtained using our approach.

Suggested Citation

  • Xiangkai Sun & Kok Lay Teo & Liping Tang, 2019. "Dual Approaches to Characterize Robust Optimal Solution Sets for a Class of Uncertain Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 984-1000, September.
    • Handle: RePEc:spr:joptap:v:182:y:2019:i:3:d:10.1007_s10957-019-01496-w
    DOI: 10.1007/s10957-019-01496-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-019-01496-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-019-01496-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J.P. Penot, 2003. "Characterization of Solution Sets of Quasiconvex Programs," Journal of Optimization Theory and Applications, Springer, vol. 117(3), pages 627-636, June.
    2. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2018. "Characterizations for Optimality Conditions of General Robust Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 177(3), pages 835-856, June.
    3. Jeyakumar, V. & Lee, G.M. & Dinh, N., 2006. "Characterizations of solution sets of convex vector minimization problems," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1380-1395, November.
    4. V. Jeyakumar & G. M. Lee & G. Li, 2015. "Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 164(2), pages 407-435, February.
    5. Fakhar, Majid & Mahyarinia, Mohammad Reza & Zafarani, Jafar, 2018. "On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 265(1), pages 39-48.
    6. X. M. Yang, 2009. "On Characterizing the Solution Sets of Pseudoinvex Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 537-542, March.
    7. Satoshi Suzuki & Daishi Kuroiwa, 2015. "Characterizations of the solution set for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential," Journal of Global Optimization, Springer, vol. 62(3), pages 431-441, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ben-Zhang Yang & Xiaoping Lu & Guiyuan Ma & Song-Ping Zhu, 2020. "Robust Portfolio Optimization with Multi-Factor Stochastic Volatility," Journal of Optimization Theory and Applications, Springer, vol. 186(1), pages 264-298, July.
    2. Kin Keung Lai & Shashi Kant Mishra & Sanjeev Kumar Singh & Mohd Hassan, 2022. "Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems," Mathematics, MDPI, vol. 10(15), pages 1-16, August.
    3. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2020. "Robustness Characterizations for Uncertain Optimization Problems via Image Space Analysis," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 459-479, August.
    4. Xiangkai Sun & Kok Lay Teo & Xian-Jun Long, 2021. "Some Characterizations of Approximate Solutions for Robust Semi-infinite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 281-310, October.
    5. Ben-Zhang Yang & Xiaoping Lu & Guiyuan Ma & Song-Ping Zhu, 2019. "Robust portfolio optimization with multi-factor stochastic volatility," Papers 1910.06872, arXiv.org, revised Jun 2020.
    6. Jiawei Chen & Suliman Al-Homidan & Qamrul Hasan Ansari & Jun Li & Yibing Lv, 2021. "Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data," Journal of Optimization Theory and Applications, Springer, vol. 189(1), pages 221-243, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vsevolod I. Ivanov, 2019. "Characterizations of Solution Sets of Differentiable Quasiconvex Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 144-162, April.
    2. Xiangkai Sun & Hongyong Fu & Jing Zeng, 2018. "Robust Approximate Optimality Conditions for Uncertain Nonsmooth Optimization with Infinite Number of Constraints," Mathematics, MDPI, vol. 7(1), pages 1-14, December.
    3. Kin Keung Lai & Shashi Kant Mishra & Sanjeev Kumar Singh & Mohd Hassan, 2022. "Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems," Mathematics, MDPI, vol. 10(15), pages 1-16, August.
    4. Satoshi Suzuki, 2019. "Optimality Conditions and Constraint Qualifications for Quasiconvex Programming," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 963-976, December.
    5. Jie Wang & Shengjie Li & Min Feng, 2022. "Unified Robust Necessary Optimality Conditions for Nonconvex Nonsmooth Uncertain Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 226-248, October.
    6. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2020. "Robustness Characterizations for Uncertain Optimization Problems via Image Space Analysis," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 459-479, August.
    7. Nader Kanzi & Majid Soleimani-damaneh, 2020. "Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization," Journal of Global Optimization, Springer, vol. 77(3), pages 627-641, July.
    8. Satoshi Suzuki, 2021. "Karush–Kuhn–Tucker type optimality condition for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential," Journal of Global Optimization, Springer, vol. 79(1), pages 191-202, January.
    9. Hong-Zhi Wei & Chun-Rong Chen & Sheng-Jie Li, 2020. "A Unified Approach Through Image Space Analysis to Robustness in Uncertain Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 466-493, February.
    10. Satoshi Suzuki & Daishi Kuroiwa, 2015. "Characterizations of the solution set for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential," Journal of Global Optimization, Springer, vol. 62(3), pages 431-441, July.
    11. S. K. Mishra & B. B. Upadhyay & Le Thi Hoai An, 2014. "Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 763-777, March.
    12. V. Jeyakumar & G. M. Lee & G. Li, 2015. "Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 164(2), pages 407-435, February.
    13. X. M. Yang, 2009. "On Characterizing the Solution Sets of Pseudoinvex Extremum Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 537-542, March.
    14. A. Kabgani & F. Lara, 2023. "Semistrictly and neatly quasiconvex programming using lower global subdifferentials," Journal of Global Optimization, Springer, vol. 86(4), pages 845-865, August.
    15. Pinar, Mehmet & Stengos, Thanasis & Topaloglou, Nikolas, 2020. "On the construction of a feasible range of multidimensional poverty under benchmark weight uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 415-427.
    16. Villacorta, Kely D.V. & Oliveira, P. Roberto, 2011. "An interior proximal method in vector optimization," European Journal of Operational Research, Elsevier, vol. 214(3), pages 485-492, November.
    17. Siqin, Zhuoya & Niu, DongXiao & Li, MingYu & Gao, Tian & Lu, Yifan & Xu, Xiaomin, 2022. "Distributionally robust dispatching of multi-community integrated energy system considering energy sharing and profit allocation," Applied Energy, Elsevier, vol. 321(C).
    18. Qamrul Hasan Ansari & Mahboubeh Rezaei, 2012. "Invariant Pseudolinearity with Applications," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 587-601, June.
    19. Vsevolod I. Ivanov, 2013. "Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 65-84, July.
    20. Nguyen Canh Hung & Thai Doan Chuong & Nguyen Le Hoang Anh, 2024. "Optimality and Duality for Robust Optimization Problems Involving Intersection of Closed Sets," Journal of Optimization Theory and Applications, Springer, vol. 202(2), pages 771-794, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:182:y:2019:i:3:d:10.1007_s10957-019-01496-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.