Pages that link to "Item:Q490149"

The following pages link to Optimality conditions and duality in nonsmooth multiobjective optimization problems (Q490149):

Displaying 19 items.

• Approximate solutions of multiobjective optimization problems (Q259809) (← links)
• A class of nonsmooth fractional multiobjective optimization problems (Q512939) (← links)
• Optimality and duality in nonsmooth composite vector optimization and applications (Q828870) (← links)
• Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications (Q1615937) (← links)
• A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization (Q1733333) (← links)
• Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems (Q1787821) (← links)
• Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications (Q2025164) (← links)
• Minimax programming as a tool for studying robust multi-objective optimization problems (Q2108806) (← links)
• Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization (Q2150766) (← links)
• Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
• Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems (Q2156706) (← links)
• Nonsmooth semi-infinite multiobjective optimization problems (Q2251568) (← links)
• Optimality and duality in nonsmooth conic vector optimization (Q2275322) (← links)
• On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
• Nondifferentiable minimax programming problems with applications (Q2404334) (← links)
• Subdifferentials and derivatives with respect to a set and applications to optimization (Q4628928) (← links)
• Efficiency conditions for multiobjective bilevel programming problems via convexificators (Q5152038) (← links)
• Sufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functions (Q6047580) (← links)
• Higher-order efficiency conditions for vector nonsmooth optimization problems using the higher-order Gâteaux derivatives (Q6645196) (← links)