Skip to main content
Log in

Optimality and duality in nonsmooth composite vector optimization and applications

  • S.I.: MOPGP 2017
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This article is devoted to the study of a nonsmooth composite vector optimization problem (P for brevity). We apply some advanced tools of variational analysis and generalized differentiation to establish necessary conditions for (weakly) efficient solutions of (P). Sufficient conditions for the existence of such solutions to (P) are also provided by means of proposing the use of (strictly) generalized convex composite vector functions with respect to a cone. We also state a dual problem to (P) and explore weak, strong and converse duality relations. In addition, applications to a multiobjective approximation problem and a composite multiobjective problem with linear operators are deployed.

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.

Similar content being viewed by others

References

  • Bot, R. I., Hodrea, I. B., & Wanka, G. (2008). Optimality conditions for weak efficiency to vector optimization problems with composed convex functions. Central European Journal of Mathematics, 6(3), 453–468.

    Article  Google Scholar 

  • Bot, R. I., Vargyas, E., & Wanka, G. (2007). Conjugate duality for multiobjective composed optimization problems. Acta Mathematica Hungarica, 116(3), 177–196.

    Article  Google Scholar 

  • Chinchuluun, A., & Pardalos, P. M. (2007). A survey of recent developments in multiobjective optimization. Annals of Operations Research, 154, 29–50.

    Article  Google Scholar 

  • Chuong, T. D. (2017). Optimality conditions for nonsmooth multiobjective bilevel optimization problems. Annals of Operations Research,. https://doi.org/10.1007/s10479-017-2734-6.

    Article  Google Scholar 

  • Chuong, T. D. (2018). Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs. SIAM Journal on Optimization, 28(3), 2466–2488.

    Article  Google Scholar 

  • Chuong, T. D. (2019). Optimality and duality in nonsmooth conic vector optimization. Journal of Optimization Theory and Applications, (to be appeared).

  • Chuong, T. D., & Kim, D. S. (2014a). Optimality conditions and duality in nonsmooth multiobjective optimization problems. Annals of Operations Research, 217, 117–136.

    Article  Google Scholar 

  • Chuong, T. D., & Kim, D. S. (2014b). Nonsmooth semi-infinite multiobjective optimization problems. Journal of Optimization Theory and Applications, 160(3), 748–762.

    Article  Google Scholar 

  • Chuong, T. D., & Kim, D. S. (2016). A class of nonsmooth fractional multiobjective optimization problems. Annals of Operations Research, 244(2), 367–383.

    Article  Google Scholar 

  • Chuong, T. D., & Kim, D. S. (2017). Nondifferentiable minimax programming problems with applications. Annals of Operations Research, 251(1–2), 73–87.

    Article  Google Scholar 

  • Clarke, F. H. (1983). Optimization and nonsmooth analysis. New York: Wiley.

    Google Scholar 

  • Craven, B. D., & Jeyakumar, V. (1986). Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem. Operations Research Letters, 5(2), 99–102.

    Article  Google Scholar 

  • Gopfert, A., Riahi, H., Tammer, C., & Zalinescu, C. (2003). Variational methods in partially ordered spaces. New York: Springer.

    Google Scholar 

  • Hiriart-Urruty, J.-B., & Lemarechal, C. (1993). Convex analysis and minimization algorithms. I. Fundamentals. Berlin: Springer.

    Book  Google Scholar 

  • Jahn, J. (2004). Vector optimization: Theory, applications, and extensions. Berlin: Springer.

    Book  Google Scholar 

  • Jeyakumar, V., & Yang, X. Q. (1993). Convex composite multi-objective nonsmooth programming. Mathematical Programming, 59(3), 325–343.

    Article  Google Scholar 

  • La Torre, D. (2003). Necessary optimality conditions for nonsmooth vector optimization problems. Mathematical Modelling and Analysis, 8(2), 165–174.

    Article  Google Scholar 

  • Lee, J. H., & Lee, G. M. (2018). On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems. Annals of Operations Research, 269(1–2), 419–438.

    Article  Google Scholar 

  • Lee, J. H., & Jiao, L. (2018). Solving fractional multicriteria optimization problems with sum of squares convex polynomial data. Journal of Optimization Theory and Applications, 176(2), 428–455.

    Article  Google Scholar 

  • Luc, D. T. (1989). Theory of vector optimization. Berlin: Springer.

    Book  Google Scholar 

  • Mishra, S. K. (1996). Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming. Optimization, 38(2), 93–105.

    Article  Google Scholar 

  • Mishra, S. K., & Mukherjee, R. N. (1995). Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency. Optimization, 34(1), 53–66.

    Article  Google Scholar 

  • Minami, M. (1983). Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space. Journal of Optimization Theory and Applications, 41(3), 451–461.

    Article  Google Scholar 

  • Mond, B., & Weir, T. (1981). Generalized concavity and duality. In S. Schaible & W. T. Ziemba (Eds.), Generalized concavity in optimization and economics (pp. 263–279). New York: Academic Press.

    Google Scholar 

  • Mordukhovich, B. S. (2006). Variational analysis and generalized differentiation: I. Basic theory. Berlin: Springer.

    Book  Google Scholar 

  • Mordukhovich, B. S. (2018). Variational analysis and applications. Switzerland: Springer.

    Book  Google Scholar 

  • Mordukhovich, B. S., Nam, N. M., & Yen, N. D. (2006). Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming. Optimization, 55, 685–708.

    Article  Google Scholar 

  • Reddy, L. V., & Mukherjee, R. N. (1999). Composite nonsmooth multiobjective programs with \(V\)-\(\rho \)-invexity. Journal of Mathematical Analysis and Applications, 235(2), 567–577.

    Article  Google Scholar 

  • Rockafellar, R. T. (1970). Convex analysis. Princeton, NJ: Princeton University Press.

    Book  Google Scholar 

  • Sach, P. H., Kim, D. S., & Lee, G. M. (2005). Generalized convexity and nonsmooth problems of vector optimization. Journal of Global Optimization, 31(3), 383–403.

    Article  Google Scholar 

  • Suneja, S. K., Sharma, S., & Yadav, P. (2018). Generalized higher-order cone-convex functions and higher-order duality in vector optimization. Annals of Operations Research, 269(1–2), 709–725.

    Article  Google Scholar 

  • Tang, L. P., & Zhao, K. Q. (2013). Optimality conditions for a class of composite multiobjective nonsmooth optimization problems. Journal of Global Optimization, 57(2), 399–414.

    Article  Google Scholar 

  • Wolfe, P. (1961). A duality theorem for nonlinear programming. Quarterly of Applied Mathematics, 19, 239–244.

    Article  Google Scholar 

Download references

Acknowledgements

The author is indebted to the three referees for helpful remarks and suggestions, which greatly improved the quality of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thai Doan Chuong.

Additional information

Dedicated to Professor Gue Myung Lee on the occasion of his 65th birthday.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chuong, T.D. Optimality and duality in nonsmooth composite vector optimization and applications. Ann Oper Res 296, 755–777 (2021). https://doi.org/10.1007/s10479-019-03349-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-019-03349-1

Keywords

Mathematics Subject Classification

Navigation