Optimality conditions for approximate solutions of vector optimization problems
From MaRDI portal
Publication:549907
DOI10.3934/jimo.2011.7.483zbMath1246.90135MaRDI QIDQ549907
Yang, Xinmin, Ying Gao, Kok Lay Teo
Publication date: 19 July 2011
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2011.7.483
approximate solutions; scalarization; vector optimization problem; cone subconvexlike; nonlinear scalar functions
90C29: Multi-objective and goal programming
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
E-Benson proper efficiency in vector optimization, A combined scalarizing method for multiobjective programming problems, On approximating weakly/properly efficient solutions in multi-objective programming, Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems, Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings, Some characterizations of the approximate solutions to generalized vector equilibrium problems, A kind of unified proper efficiency in vector optimization, Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems, Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps, Approximate proper efficiency in vector optimization, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization, Characterizing ϵ-properly efficient solutions
