Pages that link to "Item:Q353146"

The following pages link to Robust linear semi-infinite programming duality under uncertainty (Q353146):

Displaying 28 items.

• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
• Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality (Q778163) (← links)
• Characterizing robust local error bounds for linear inequality systems under data uncertainty (Q891541) (← links)
• Robust global error bounds for uncertain linear inequality systems with applications (Q905714) (← links)
• Complete characterizations of robust strong duality for robust vector optimization problems (Q1639956) (← links)
• SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
• Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
• A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
• Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems (Q1730467) (← links)
• Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
• Robustness in deterministic vector optimization (Q1730805) (← links)
• Duality for robust linear infinite programming problems revisited (Q2022437) (← links)
• On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
• Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
• Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
• Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
• On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
• Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
• Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
• Robust solutions to multi-objective linear programs with uncertain data (Q2630217) (← links)
• Radius of robust global error bound for piecewise linear inequality systems (Q2664894) (← links)
• On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty (Q2687494) (← links)
• Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems (Q2688886) (← links)
• On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization (Q2693835) (← links)
• Robustness in deterministic multi-objective linear programming with respect to the relative interior and angle deviation (Q2836085) (← links)
• Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data (Q6159528) (← links)