Acta Mathematica Scientia

, Volume 39, Issue 2, pp 382–394 | Cite as

The Characterization of Efficiency and Saddle Point Criteria for Multiobjective Optimization Problem with Vanishing Constraints

  • Anurag Jayswal
  • Vivek SinghEmail author


In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.

Key words

multiobjective optimization problem with vanishing constraints efficient solution invexity η-Lagrange function saddle point 

2010 MR Subject Classification

26B25 90C29 90C30 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Achtziger W, Kanzow C. Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications. Math Prog, 2008, 114(1): 69–99MathSciNetCrossRefzbMATHGoogle Scholar
  2. [2]
    Antczak T. A new approach to multiobjective programming with a modified objective function. J Global Optim, 2003, 27(4): 485–495MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    Antczak T. An η-approximation method in nonlinear vector optimization. Nonlinear Anal, 2005, 63(2): 225–236MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    Facchinei F, Pang J S. Finite-Dimensional Variational Inequalities and Complementarity Problems. New York: Springer, 2003zbMATHGoogle Scholar
  5. [5]
    Hanson M A. On sufficiency of the Kuhn-Tucker conditions. J Math Anal Appl, 1981, 80(2): 545–550MathSciNetCrossRefzbMATHGoogle Scholar
  6. [6]
    Hoheisel T, Kanzow C. First and second-order optimality conditions for mathematical programs with vanishing constraints. Appl Math, 2007, 52(6): 495–514MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    Hoheisel T, Kanzow C. Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications. J Math Anal Appl, 2008, 337(1): 292–310MathSciNetCrossRefzbMATHGoogle Scholar
  8. [8]
    Hoheisel T, Kanzow C. On the Abadie and Guignard constraint qualification for mathematical programmes with vanishing constraints. Optimization, 2009, 58(4): 431–448MathSciNetCrossRefzbMATHGoogle Scholar
  9. [9]
    Luo Z Q, Pang J S, Ralph D. Mathematical Programs with Equilibrium Constraints. Cambridge: Cambridge University Press, 1996CrossRefzbMATHGoogle Scholar
  10. [10]
    Mishra S K, Singh V, Laha V, Mohapatra R N. On Constraint qualifications for multiobjective optimization problems with vanishing constraints//Optimization Methods, Theory and Applications. Berlin, Heidelberg: Springer, 2015: 95–135Google Scholar
  11. [11]
    Outrarata J V, Kocvara M, Zowe J. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Dordrecht: Kluwer Academic Publishers, 1998CrossRefGoogle Scholar
  12. [12]
    Pareto V. Cours de Economie Politique. Switzerland: Rouge, Lausanne, 1896Google Scholar
  13. [13]
    Tanino T, Sawaragi Y. Duality theory in multiobjective programming. J Optim Theory Appl, 1979, 27(4): 509–529MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Wuhan Institute Physics and Mathematics, Chinese Academy of Sciences 2019

Authors and Affiliations

  1. 1.Department of Applied MathematicsIndian Institute of Technology (Indian School of Mines)DhanbadIndia

Personalised recommendations