\(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
From MaRDI portal
Publication:2277144
DOI10.1007/BF00940466zbMath0724.90057MaRDI QIDQ2277144
Publication date: 1991
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
multi-objective programming\(\epsilon \) - Pareto optimality\(\epsilon \) -duality theoremNecessary Kuhn-Tucker conditionsnondifferentiable, nonconvex, multi-objective minimizationscalar penalty functions
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items (51)
On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ \(\varepsilon\)-optimality for multiobjective programming on a Banach space ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ On several concepts for \(\varepsilon\)-efficiency ⋮ Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ On approximate efficiency in multiobjective programming ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Characterizing ϵ-properly efficient solutions ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ Optimality via generalized approximate convexity and quasiefficiency ⋮ Two Types of Approximate Saddle Points ⋮ Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications ⋮ Approximate solutions for robust multiobjective optimization programming in Asplund spaces ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Unnamed Item ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Unnamed Item ⋮ Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems ⋮ Unnamed Item ⋮ ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ \(\varepsilon\)-optimality and duality for multiobjective fractional programming ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming ⋮ On approximate solutions for nonsmooth robust multiobjective optimization problems ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ Necessary optimality conditions and saddle points for approximate optimization in Banach space ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming ⋮ Approximate solutions of multiobjective optimization problems ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems
Cites Work
This page was built for publication: \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
