Skip to main content
Log in

Optimality conditions in convex multiobjective SIP

  • Full Length Paper
  • Published:
Mathematical Programming Submit manuscript

Abstract

The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, and the isolated efficient solutions of a given vector optimization problem with finitely many convex objective functions and infinitely many convex constraints. To do this, we introduce new and already known data qualifications (conditions involving the constraints and/or the objectives) in order to get optimality conditions which are expressed in terms of either Karusk–Kuhn–Tucker multipliers or a new gap function associated with the given problem.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amahroq, T., Penot, J.-P., Say, A.: On the subdifferentiability of the difference of two functions and local minimization. Set-Valued Anal. 16, 413–427 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Auslender, A.: Optimisation: Méthodes Numériques. Masson, Paris (1976)

    MATH  Google Scholar 

  3. Auslender, A.: Stability in mathematical programming with nondifferentiable data. SIAM J. Control Optim. 22, 239–254 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Caristi, G., Ferrara, M., Stefanescu, A.: Semi-infinite multiobjective programming with generalized invexity. Math. Rep. 12, 217–233 (2010)

    MathSciNet  MATH  Google Scholar 

  5. Chen, C.Y., Goh, C.J., Yang, X.Q.: The gap function of a convex multicriteria optimization problem. Eur. J. Oper. Res. 111, 142–151 (1998)

    Article  MATH  Google Scholar 

  6. Chuong, T.D., Kim, D.S.: Nonsmooth semi-infinite multiobjective optimization problems. J. Optim. Theory Appl. 160, 748–762 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chuong, T.D., Yao, J.-C.: Isolated and proper efficiencies in semi-infinite vector optimization problems. J. Optim. Theory Appl. 162, 447–462 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dinh, N., Goberna, M.A., Long, D.H., López, M.A.: Characterizing weak solutions for vector optimization problems. arXiv:1602.03367

  9. Dinh, N., Goberna, M.A., López, M.A., Son, T.Q.: New Farkas-type constraint qualifications in convex infinite programming. ESAIM Control Optim. Calc. Var. 13, 580–597 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dumford, N., Schwartz, J.T.: Linear Operators: General Theory. Wiley, Chichester (1988)

    Google Scholar 

  11. Ginchev, I., Guerraggio, A., Rocca, M.: From scalar to vector optimization. Appl. Math. 51, 618–630 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Goberna, M.A., Gómez, S., Guerra, F., Todorov, M.I.: Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients. Eur. J. Oper. Res. 181, 1069–1085 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Goberna, M.A., Guerra-Vazquez, F., Todorov, M.I.: Constraint qualifications in linear vector semi-infinite optimization. Eur. J. Oper. Res. 227, 12–21 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  14. Goberna, M.A., Guerra-Vazquez, F., Todorov, M.I.: Constraint qualifications in convex vector semi-infinite optimization. Eur. J. Oper. Res. 249, 32–40 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley, Chichester (1998)

    MATH  Google Scholar 

  16. Goberna, M.A., Terlaky, T., Todorov, M.I.: Sensitivity analysis in linear semi-infinite programming via partitions. Math. Oper. Res. 35, 14–25 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Grad, S.M.: Closedness type regularity conditions in convex optimization and beyond. Front Appl Math Stat. (2016). doi:10.3389/fams.2016.00014

    Google Scholar 

  18. Guerra-Vazquez, F., Rückmann, J.-J.: On proper efficiency in multiobjective semi-infinite optimization. In: Xu, H., Teo, K.L., Zhang, Y. (eds.) Optimization and Control Techniques and Applications, pp. 115–135. Springer, Berlin (2014)

    Google Scholar 

  19. Hearn, D.W.: The gap function of a convex program. Oper. Res. Lett. 1, 67–71 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms. I. Springer, Berlin (1991)

    MATH  Google Scholar 

  21. Jongen, H.T., Twilt, F., Weber, G.W.: Semi-infinite optimization: structure and stability of feasible set. J. Optim. Theory Appl. 72, 529–552 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kanzi, N.: Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints. SIAM J. Optim. 24, 559–572 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  23. Kanzi, N.: On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data. Optim. Lett. 9, 1121–1129 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  24. Kanzi, N., Soleimani-damaneh, M.: Slater CQ optimality and duality for quasiconvex semi-infinite optimization problems. J. Math. Anal. Appl. 434, 638–651 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  25. Kanzi, N., Nobakhtian, S.: Optimality conditions for nonsmooth semi-infinite multiobjective programming. Optim. Lett. 8, 1517–1528 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kuroiwa, D., Lee, G.M.: On robust convex multiobjective optimization. J. Nonlinear Convex Anal. 15, 1125–1136 (2014)

    MathSciNet  MATH  Google Scholar 

  27. Li, W., Nahak, C., Singer, I.: Constraint qualifications in semi-infinite systems of convex inequalities. SIAM J. Optim. 11, 31–52 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  28. Maeda, T.: Constraint qualifications in multiobjective optimization problems: differentiable case. J. Optim. Theory Appl. 80, 483–500 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  29. Mordukhovich, B.S., Nghia, T.T.A.: Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs. Math. Program. 139B, 271–300 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  30. Precupanu, T.: Closedness conditions for the optimality of a family of nonconvex optimization problems. Math. Operationsforsch. Stat. Ser. Optim. 15, 339–346 (1984)

    MathSciNet  MATH  Google Scholar 

  31. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    Book  MATH  Google Scholar 

  32. Sarabi, M.E., Soleimani-damaneh, M.: Revisiting the function of a multicriteria optimization problem. Int. J. Comput. Math. 86, 860–863 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  33. Soleimani-damaneh, M.: The gap function for optimization problems in Banach spaces. Nonlinear Anal. 69, 716–723 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  34. Soleimani-damaneh, M.: Nonsmooth optimization using Mordukhovich subdifferential. SIAM J. Control Optim. 48, 3403–3432 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  35. Tanino, T.: Conjugate duality in vector optimization. J. Math. Anal. Appl. 167, 84–97 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  36. Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)

    Book  MATH  Google Scholar 

Download references

Acknowledgments

The authors are very grateful to the referees for their constructive comments, specially for having suggested the comparison of the data qualifications used in this paper with the regularity conditions recently introduced in [17].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Miguel A. Goberna.

Additional information

This research was partially cosponsored by the Ministry of Economy and Competitiveness (MINECO) of Spain, and by the European Regional Development Fund (ERDF) of the European Commission, Project MTM2014-59179-C2-1-P.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goberna, M.A., Kanzi, N. Optimality conditions in convex multiobjective SIP. Math. Program. 164, 167–191 (2017). https://doi.org/10.1007/s10107-016-1081-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-016-1081-8

Mathematics Subject Classification

Navigation