Pages that link to "Item:Q2503214"

The following pages link to Characterizations of solution sets of convex vector minimization problems (Q2503214):

Displaying 36 items.

• On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
• On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
• A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
• Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces (Q450594) (← links)
• An interior proximal method in vector optimization (Q635150) (← links)
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
• Optimality conditions for weak efficiency to vector optimization problems with composed convex functions (Q944049) (← links)
• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
• On characterizing the solution sets of pseudoinvex extremum problems (Q1016423) (← links)
• Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
• On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
• Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
• On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864) (← links)
• On the transformation of lexicographic nonlinear multiobjective programs to single objective programs (Q1935897) (← links)
• A note on characterizing solution set of nonsmooth pseudoinvex optimization problem (Q1936800) (← links)
• Characterizations of the solution set for a class of nonsmooth optimization problems (Q1947617) (← links)
• On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
• Vector topical functions and Farkas type theorems with applications (Q2017838) (← links)
• On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
• On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
• Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
• Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems (Q2251569) (← links)
• Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
• Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces (Q2271148) (← links)
• On set containment characterizations for sets described by set-valued maps with applications (Q2302829) (← links)
• On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
• Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
• Characterizations of solution sets of differentiable quasiconvex programming problems (Q2420773) (← links)
• Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
• On characterizing solution set of non-differentiable η-pseudolinear extremum problem (Q3225080) (← links)
• (Q3384701) (← links)
• Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)
• On characterizations of solution sets of interval-valued quasiconvex programming problems (Q6181225) (← links)