Skip to main content
SpringerLink
Log in

Scalarization of Levitin–Polyak well-posedness in vector optimization using weak efficiency

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we study Levitin–Polyak (LP in short) well-posedness of a vector optimization problem (P) in the vectorial sense as well as scalar sense and establish a relation between them. Sufficiency conditions for LP well-posedness for both the notions have been discussed. Further, we use the notion of approximate solutions of scalarized problems associated with problem (P) to establish some other sufficiency criteria for LP well-posedness. This is achieved by establishing sufficiency conditions in terms of closedness and upper semicontinuity of approximate solution map and upper Hausdorff convergence of sequences of approximate solution sets. Finally, we establish the Painlevé–Kuratowski set-convergence of a sequence of optimal solution sets of scalarized problems to the weakly efficient solution set of (P).

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Nonlinear Parametric Optimization. Birkhäuser Verlag, Basel (1983)

    Google Scholar 

  2. Bednarczuk, E.: An approach to well-posedness in vector optimization: consequences to stability, parametric optimization. Control Cybern. 23, 107–122 (1994)

    MATH  MathSciNet  Google Scholar 

  3. Dontchev, A., Zolezzi, T.: Well-Posed Optimization Problems in Lecture Notes in Mathematics, vol. 1543. Springer, Berlin (1993)

    Google Scholar 

  4. Durea, M.: Scalarization for pointwise well-posed vectorial problems. Math. Methods Oper. Res. 66, 409–418 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  5. Furi, M., Vignoli, A.: About well-posed optimization problems for functionals in metric spaces. J. Optim. Theory Appl. 5, 223–229 (1970)

  6. Gerstewitz, C.: Nichtkonvexe Dualität in der Vectoroptimierung. Wiss. Z. Tech. Hochsch. Leuna-Merseburg 25, 357–364 (1983)

    MATH  MathSciNet  Google Scholar 

  7. Gerth, C., Weidner, P.: Nonconvex separation theorems and some applications in vector optimization. J. Optim. Theory Appl. 67, 297–320 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Göpfert, A., Riahi, H., Tammer, C., Zălinescu, C.: Variational Methods in Partially Ordered Spaces, CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC 17. Springer, New York (2003)

    Google Scholar 

  9. Gutiérrez, C., Jiménez, B., Novo, V.: On approximate solution in vector optimization problems via scalarization. Comput. Optim. Appl. 35, 305–324 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Huang, X.X., Yang, X.Q.: Generalized Levitin–Polyak well-posedness in constrained optimization. SIAM J. Optim. 17, 243–258 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Huang, X.X., Yang, X.Q.: Levitin–Polyak well-posedness of constrained vector optimization problems. J. Glob. Optim. 37, 287–304 (2007)

    Article  MATH  Google Scholar 

  12. Huang, X.X., Yang, X.Q.: Further study on the Levitin–Polyak well-posedness of constrained convex vector optimization problems. Nonlinear Anal. 75, 1341–1347 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  13. Konsulova, A.S., Revalski, J.P.: Constrained convex optimization problems-well-posedness and stability. Numer. Funct. Anal. Optim. 15, 889–907 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lalitha, C.S., Chatterjee, P.: Stability for properly quasiconvex vector optimization problem. J. Optim. Theory Appl. 155, 492–506 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lalitha, C.S., Chatterjee, P.: Stability and scalarization of weak efficient, efficient and Henig proper efficient sets using generalized quasiconvexities. J. Optim. Theory Appl. 155, 941–961 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lalitha, C.S., Chatterjee, P.: Levitin–Polyak well-posedness for constrained quasiconvex vector optimization problems. J. Glob. Optim. 59, 191–205 (2014)

  17. Levitin, E.S., Polyak, B.T.: Convergence of minimizing sequences in conditional extremum problems. Soviet Math. Dokl. 7, 764–767 (1966)

    MATH  Google Scholar 

  18. Li, S.J., Yang, X.Q., Chen, G.Y.: Nonconvex vector optimization of set-valued mappings. J. Math. Anal. Appl. 283, 337–350 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Luc, D.T.: Theory of Vector Optimization vol. 319 Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (1989)

    Google Scholar 

  20. Lucchetti, R.E., Miglierina, E.: Stability for convex vector optimization problems. Optimization 53, 517–528 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Miglierina, E., Molho, E., Rocca, M.: Well-posedness and scalarization in vector optimization. J. Optim. Theory Appl. 126, 391–409 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  22. Rockafeller, R.T., Wets, R.J.-B.: Variational Analysis, Grundlehren der Mathematischen Wisenschaften, vol. 317. Springer, Berlin (1998)

    Google Scholar 

  23. Tykhonov, A.N.: On the stability of the functional optimization problem. U.S.S.R. Comput. Math. Math. Phys. 6, 28–33 (1966)

    Article  Google Scholar 

  24. Zeng, J., Li, S.J., Zhang, W.Y., Xue, X.W.: Stability results for convex vector-valued optimization problems. Positivity 15, 441–453 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  25. Zhu, L., Xia, F.: Scalarization method for Levitin–Polyak well-posedness of vectorial optimization problems. Math. Methods Oper. Res. 76, 361–375 (2012)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

Research of C. S. Lalitha is supported by R&D Doctoral Research programme for University faculty. The authors are grateful to the reviewers for their valuable comments and suggestions which helped in improving the paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, St. Stephen’s College, University of Delhi, Delhi , 110007, India

    Prashanto Chatterjee

  2. Department of Mathematics, University of Delhi South Campus, Benito Jaurez Road, New Delhi , 110021, India

    C. S. Lalitha

Authors
  1. Prashanto Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. S. Lalitha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Prashanto Chatterjee.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chatterjee, P., Lalitha, C.S. Scalarization of Levitin–Polyak well-posedness in vector optimization using weak efficiency. Optim Lett 9, 329–343 (2015). https://doi.org/10.1007/s11590-014-0745-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0745-7

Keywords

Search

Navigation