Pages that link to "Item:Q1028592"

The following pages link to \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592):

Displaying 35 items.

• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints (Q377740) (← links)
• Some new properties of the Lagrange function and its applications (Q385666) (← links)
• A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
• Subdifferential of optimal value functions in nonlinear infinite programming (Q434364) (← links)
• Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian (Q454254) (← links)
• \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions (Q536840) (← links)
• Optimality conditions and the basic constraint qualification for quasiconvex programming (Q622397) (← links)
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems (Q1660296) (← links)
• On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
• Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications (Q2025164) (← links)
• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data (Q2037900) (← links)
• On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data (Q2067760) (← links)
• An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
• On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
• On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
• Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems (Q2392783) (← links)
• On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems (Q2693966) (← links)
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization (Q2841152) (← links)
• Characterizing ϵ-properly efficient solutions (Q2943836) (← links)
• ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps (Q3578000) (← links)
• Characterizations of robust<i>ε</i>-quasi optimal solutions for nonsmooth optimization problems with uncertain data (Q4986407) (← links)
• Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions (Q4987689) (← links)
• Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty (Q5121777) (← links)
• Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization (Q5213382) (← links)
• On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems (Q5244131) (← links)
• Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators (Q5865281) (← 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 characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems (Q6187726) (← links)
• Approximate optimal solutions for multiobjective optimization problems with infinite constraints (Q6196813) (← links)
• Approximate optimality conditions for nonsmooth optimization problems (Q6652839) (← links)