Pages that link to "Item:Q1002073"
From MaRDI portal
The following pages link to Duality in robust optimization: Primal worst equals dual best (Q1002073):
Displaying 50 items.
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
- Robust canonical duality theory for solving nonconvex programming problems under data uncertainty (Q328533) (← links)
- On the integration of row and column uncertainty in robust linear programming (Q330263) (← links)
- Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Robust fractional programming (Q493047) (← links)
- Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment (Q496622) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← 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)
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality (Q778163) (← links)
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems (Q828816) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- Robustness in nonsmooth nonconvex optimization problems (Q830202) (← links)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
- Complete characterizations of robust strong duality for robust vector optimization problems (Q1639956) (← links)
- A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem (Q1654362) (← links)
- Characterizations for optimality conditions of general robust optimization problems (Q1670134) (← 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)
- Robust inventory control under demand and lead time uncertainty (Q1699168) (← links)
- Primal worst and dual best in robust vector optimization (Q1719614) (← links)
- Conditions under which adjustability lowers the cost of a robust linear program (Q1730447) (← links)
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems (Q1730467) (← links)
- A survey of adjustable robust optimization (Q1740490) (← links)
- Robust optimization approaches for the equitable and effective distribution of donated food (Q1750466) (← links)
- A unified approach to uncertain optimization (Q1753451) (← links)
- Robust assessment of collapse resistance of structures under uncertain loads based on info-gap model (Q1798554) (← links)
- On robustness for set-valued optimization problems (Q2022296) (← links)
- A robust optimization approach for the multi-mode resource-constrained project scheduling problem (Q2030698) (← links)
- Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function (Q2053413) (← links)
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators (Q2074630) (← links)
- Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions (Q2083396) (← links)
- Robust optimization for lot-sizing problems under yield uncertainty (Q2108119) (← links)
- Minimax programming as a tool for studying robust multi-objective optimization problems (Q2108806) (← links)
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data (Q2136884) (← links)
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint (Q2142822) (← links)
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems (Q2156706) (← links)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- Robustness characterizations for uncertain optimization problems via image space analysis (Q2194124) (← links)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
- Recent advances in robust optimization: an overview (Q2256312) (← links)
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← 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)
