Skip to main content
Log in

Characterizations for Optimality Conditions of General Robust Optimization Problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, by virtue of the image space analysis, the general scalar robust optimization problems under the strictly robust counterpart are considered, among which, the uncertainties are included in the objective as well as the constraints. Besides, on the strength of a corrected image in a new type, an equivalent relation between the uncertain optimization problem and its image problem is also established, which provides an idea to tackle with minimax problems. Furthermore, theorems of the robust weak alternative as well as sufficient characterizations of robust optimality conditions are achieved on the frame of the linear and nonlinear (regular) weak separation functions. Moreover, several necessary and sufficient optimality conditions, especially saddle point sufficient optimality conditions for scalar robust optimization problems, are obtained. Finally, a simple example for finding a shortest path is included to show the effectiveness of the results derived in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21, 1154–1157 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769–805 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)

    Book  MATH  Google Scholar 

  4. Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Amsterdam (1997)

    Book  MATH  Google Scholar 

  5. Jeyakumar, V., Li, G.Y.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 20, 3384–3407 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jeyakumar, V., Lee, G.M., Li, G.Y.: Characterizing robust solution sets of convex programs under data uncertainty. J. Optim. Theory Appl. 164, 407–435 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lee, G.M., Son, P.T.: On nonsmooth optimality theorems for robust optimization problems. Bull. Korean Math. Soc. 51, 287–301 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. Ser. A 88, 411–420 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Beck, A., Ben-Tal, A.: Duality in robust optimization: primal worst equals dual best. Oper. Res. Lett. 37, 1–6 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gorissen, B.L., Blanc, H., den Hertog, D., Ben-Tal, A.: Technical note-deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets. Oper. Res. 62, 672–679 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Castellani, G., Giannessi, F.: Decomposition of mathematical programs by means of theorems of alternative for linear and nonlinear systems. In: Proceedings of the Ninth International Mathematical Programming Symposium, Budapest. Survey of Mathematical Programming, North-Holland, Amsterdam, pp. 423–439 (1979)

  12. Giannessi, F.: Constrained Optimization and Image Space Analysis, vol. 1: Separation of Sets and Optimality Conditions. Springer, Berlin (2005)

    MATH  Google Scholar 

  13. Giannessi, F., Mastroeni, G.: Separation of sets and Wolfe duality. J. Glob. Optim. 42, 401–412 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Luo, H.Z., Mastroeni, G., Wu, H.X.: Separation approach for augmented Lagrangians in constrained nonconvex optimization. J. Optim. Theory Appl. 144, 275–290 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mastroeni, G.: Some applications of the image space analysis to the duality theory for constrained extremum problems. J. Glob. Optim. 46, 603–614 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Li, S.J., Xu, Y.D., Zhu, S.K.: Nonlinear separation approach to constrained extremum problems. J. Optim. Theory Appl. 154, 842–856 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mastroeni, G.: Nonlinear separation in the image space with applications to penalty methods. Appl. Anal. 91, 1901–1914 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Li, J., Huang, N.J.: Image space analysis for variational inequalities with cone constraints applications to traffic equilibria. Sci. China Math. 55, 851–868 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  19. Zhu, S.K., Li, S.J.: Unified duality theory for constrained extremum problems. Part I: image space analysis. J. Optim. Theory Appl. 161, 738–762 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  20. Xu, Y.D.: Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities. Optim. Lett. 10, 527–542 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  21. Li, J., Mastroeni, G.: Image convexity of generalized systems with infinite-dimensional image and applications. J. Optim. Theory Appl. 169, 91–115 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  22. Lewis, A., Pang, C.: Lipschitz behavior of the robust regularization. SIAM J. Control Optim. 48(5), 3080–3105 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  23. Eichfelder, G., Krüger, C., Schöbel, A.: Decision uncertainty in multiobjective optimization. J. Glob. Optim. 69, 485–510 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  24. Hiriart-Urruty, J.B.: Tangent cone, generalized gradients and mathematical programming in Banach spaces. Math. Oper. Res. 4, 79–97 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  25. Zaffaroni, A.: Degrees of efficiency and degrees of minimality. SIAM J. Control Optim. 42, 1071–1086 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kuroiwa, D., Lee, G.M.: On robust multiobjective optimization. Vietnam J. Math. 40, 305–317 (2012)

    MathSciNet  MATH  Google Scholar 

  27. Ehrgott, M., Ide, J., Schöbel, A.: Minmax robustness for multi-objective optimization problems. Eur. J. Oper. Res. 239, 17–31 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  28. Khan, A.A., Tammer, C., Zălinescu, C.: Set-Valued Optimization: An Introduction with Applications. Springer, Berlin (2015)

    Book  MATH  Google Scholar 

  29. Ide, J., Schöbel, A.: Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts. OR Spectrum 38, 235–271 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  30. Wei, H.Z., Chen, C.R., Li, S.J.: A unified characterization of multiobjective robustness via separation. J. Optim. Theory Appl. (2017). https://doi.org/10.1007/s10957-017-1196-y

    Google Scholar 

Download references

Acknowledgements

The authors gratefully thank the anonymous referees and Professor F. Giannessi for their constructive suggestions and comments, which helped to improve the paper. Also thanks to Manxue You (Chongqing University) for helpful discussions on the image space analysis.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chun-Rong Chen.

Additional information

This research was supported by the National Natural Science Foundation of China (Grant Numbers: 11301567 and 11571055) and the Fundamental Research Funds for the Central Universities (Grant Number: 106112015CDJXY100002).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wei, HZ., Chen, CR. & Li, SJ. Characterizations for Optimality Conditions of General Robust Optimization Problems. J Optim Theory Appl 177, 835–856 (2018). https://doi.org/10.1007/s10957-018-1256-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-018-1256-y

Keywords

Mathematics Subject Classification

Navigation