Optimality conditions and duality in nonsmooth multiobjective optimization problems

From MaRDI portal
Publication:490149

DOI10.1007/s10479-014-1552-3zbMath1304.90184OpenAlexW2013569980MaRDI QIDQ490149

Thai Doan Chuong, Do Sang Kim

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1552-3




Related Items

Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applicationsOptimality and duality in nonsmooth composite vector optimization and applicationsApproximate solutions in nonsmooth and nonconvex cone constrained vector optimizationSecond-order cone programming relaxations for a class of multiobjective convex polynomial problemsOptimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problemsNondifferentiable minimax programming problems with applicationsSufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functionsRobust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain dataSubdifferentials and derivatives with respect to a set and applications to optimizationA note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimizationEfficiency conditions for multiobjective bilevel programming problems via convexificatorsA class of nonsmooth fractional multiobjective optimization problemsNonsmooth semi-infinite multiobjective optimization problemsOptimality and duality in nonsmooth conic vector optimizationOptimality conditions for minimax optimization problems with an infinite number of constraints and related applicationsNecessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problemsOn approximate solutions of nondifferentiable vector optimization problems with cone-convex objectivesMinimax programming as a tool for studying robust multi-objective optimization problemsApproximate solutions of multiobjective optimization problems



Cites Work