Pages that link to "Item:Q974991"

The following pages link to Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991):

Displaying 32 items.

• Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty (Q432370) (← links)
• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
• Robust duality in parametric convex optimization (Q491220) (← links)
• Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
• New strong duality results for convex programs with separable constraints (Q613429) (← links)
• Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
• Robust duality for generalized convex programming problems under data uncertainty (Q654075) (← links)
• Robust duality for fractional programming problems with constraint-wise data uncertainty (Q658562) (← links)
• Robust fuzzy structural safety assessment using mathematical programming approach (Q679749) (← links)
• On robust duality for fractional programming with uncertainty data (Q743463) (← 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)
• Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems (Q1730467) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470) (← links)
• Robust assessment of collapse resistance of structures under uncertain loads based on info-gap model (Q1798554) (← links)
• Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
• Global optimality condition for quadratic optimization problems under data uncertainty (Q2045908) (← links)
• Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function (Q2053413) (← links)
• On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
• Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
• Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
• Strong and total Fenchel dualities for robust convex optimization problems (Q2262012) (← links)
• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty (Q2275574) (← links)
• On set containment characterizations for sets described by set-valued maps with applications (Q2302829) (← 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)
• Surrogate duality for robust optimization (Q2356091) (← links)
• An exact formula for radius of robust feasibility of uncertain linear programs (Q2401515) (← links)
• Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications (Q2661520) (← links)