Pages that link to "Item:Q259809"

The following pages link to Approximate solutions of multiobjective optimization problems (Q259809):

Displaying 32 items.

• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
• On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data (Q2037900) (← links)
• An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem (Q2101160) (← links)
• Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization (Q2150766) (← links)
• Approximations for Pareto and proper Pareto solutions and their KKT conditions (Q2168054) (← links)
• On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
• Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
• A note on approximate proper efficiency in linear fractional vector optimization (Q2673534) (← links)
• Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm (Q2675732) (← links)
• On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems (Q2693966) (← links)
• (Q3383228) (← links)
• (Q3384701) (← links)
• Optimality, scalarization and duality in linear vector semi-infinite programming (Q4643678) (← links)
• Characterizations of robust<i>ε</i>-quasi optimal solutions for nonsmooth optimization problems with uncertain data (Q4986407) (← links)
• Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization (Q4999342) (← links)
• Approximate solutions of interval-valued optimization problems (Q5019102) (← links)
• Optimality Conditions for Approximate Pareto Minimality (Q5107284) (← links)
• (Q5126299) (← links)
• Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization (Q5213382) (← links)
• On approximate solutions for nonsmooth robust multiobjective optimization problems (Q5239079) (← links)
• On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems (Q5244131) (← links)
• Further results on quasi efficient solutions in multiobjective optimization (Q6085812) (← links)
• On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data (Q6126586) (← links)
• Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data (Q6159528) (← links)
• A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems (Q6192422) (← links)
• Approximate optimal solutions for multiobjective optimization problems with infinite constraints (Q6196813) (← links)
• Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications (Q6197115) (← links)
• Continuous time non-smooth optimization through quasi efficiency (Q6633657) (← links)
• Approximate optimality conditions for nonsmooth optimization problems (Q6652839) (← links)
• Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints (Q6671901) (← links)