Advertisement

Optimality Conditions for a Class of Major Constraints Nonsmooth Multi-objective Programming Problems

  • Xuanwei ZhouEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1084)

Abstract

The optimality conditions of major constraints nonsmooth programming with multi-objectives are studied. The objective function of this class of multi-objective programming is the sum of a convex vector function and a differentiable vector function. The constraint condition is major cone constraint in Euclid space. By using of the structure representation of major cone constraint of the given problem, the Fritz John condition of Pareto weakly effective solution is obtained by Gordan theorem. Meanwhile, the Kuhn-Tucker condition for Pareto weakly effective solution under Slater constraint qualification is given. The results are very useful to design its numerical methods.

Keywords

Nonsmooth multiobjective programming Gordan theorem Fritz John condition Slater constraint qualification Kuhn-Tucker condition 

References

  1. 1.
    Bao, T.Q., Gupta, P., Mordukhovich, B.S.: Necessary conditions in multiobjective optimization with equilibrium constraints. J. Optim. Theory Appl. 135, 179–203 (2007)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bao, T.Q., Mordukhovich, B.S.: Variational principles for set-valued mappings with applications to multiobjective optimization. Control Cybernet. 36, 531–562 (2007)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Bao, T.Q., Mordukhovich, B.S.: Necessary conditions for super minimizers in constrained multiobjective optimization. J. Glob. Optim. 43, 533–552 (2009)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bao, T.Q., Mordukhovich, B.S.: Relative Pareto minimizers for multiobjective problems: existence and optimality conditions. Math. Program. 122, 301–347 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Luc, D.T.: On duality theorems in multiobjective programming. J. Optim. Theory Appl. 48, 557–582 (1984)CrossRefGoogle Scholar
  6. 6.
    Ben-Tal, A., Zowe, J.A.: Unified theory of first and second order conditions for extremum problems in topological vector spaces. Math. Program. Study 19, 39–76 (1982)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Michel, V.: Theorems of the alternative for multivalued mappings and applications to mixed convex\concave systems of inequalities. Set-Valued Anal. 18, 601–616 (2010)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Yang, X.M.: Generalized Preinvexity and Second Order Duality in Multiobjective Programming. Springer, Singapore (2018)CrossRefGoogle Scholar
  9. 9.
    Luc, D.T.: Multiobjective Linear Programming: An Introduction. Springer, Cham (2016)CrossRefGoogle Scholar
  10. 10.
    Mond, B.: A class of nondifferentiable mathematical programming problems. J. Math. Anal. Appl. 46, 169–174 (1974)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Mond, B., Schechter, M.A.: On a constraint qualification in a nonlinear programming problems. New Res. Logic Q. 23, 611–613 (1976)CrossRefGoogle Scholar
  12. 12.
    Xu, Z.K.: Constraint qualifications in a class of nondifferentiable mathematical programming problems. J. Math. Anal. Appl. 302, 282–290 (2005)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Luo, H.Z., Wu, H.X.: K-T necessary conditions for a class of nonsmooth multiobjective programming. OR Trans. 7, 62–68 (2003)Google Scholar
  14. 14.
    Wu, H.X., Luo, H.Z.: Necessary optimality conditions for a class of nonsmooth vector optimization problems. Acta Math. Appl. Sinica 25, 87–94 (2009)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Yang, X.M., Yang, X.Q., Teo, K.L.: Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming. J. Math. Anal. Appl. 297, 48–55 (2004)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Hu, Y.D.: Classes of major order of vector space. Chin. Ann. Math. 11, 269–280 (1990)zbMATHGoogle Scholar
  17. 17.
    Hu, Y.D., Zhou, X.W.: Major constraint programming and its optimality conditions. OR Trans. 6, 69–75 (2002)Google Scholar
  18. 18.
    Rockfellar, R.T.: Convex Analysis. Princeton University Press, New Jersey (1972)Google Scholar
  19. 19.
    Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms. Wiley, Hoboken (2006)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.School of Basic CoursesZhejiang Shuren UniversityHangzhouChina

Personalised recommendations