Pages that link to "Item:Q1849501"

The following pages link to Robust optimization-methodology and applications (Q1849501):

Displaying 50 items.

• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty (Q2275574) (← links)
• Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
• An integrated supply chain configuration model and procurement management under uncertainty: a set-based robust optimization methodology (Q2293443) (← links)
• A model of distributionally robust two-stage stochastic convex programming with linear recourse (Q2295314) (← links)
• A general framework for robust topology optimization under load-uncertainty including stress constraints (Q2309806) (← links)
• Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
• The wait-and-judge scenario approach applied to antenna array design (Q2320467) (← links)
• Dynamic network design problem under demand uncertainty: an adjustable robust optimization approach (Q2321493) (← 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)
• Derivative-free robust optimization for circuit design (Q2342134) (← links)
• RMARS: robustification of multivariate adaptive regression spline under polyhedral uncertainty (Q2349687) (← links)
• Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
• Robust nonlinear optimization with conic representable uncertainty set (Q2355077) (← links)
• Optimality conditions and duality for arcwise connected interval optimization problems (Q2359242) (← links)
• Robust and reliable portfolio optimization formulation of a chance constrained problem (Q2360112) (← links)
• Distribution-robust loss-averse optimization (Q2361137) (← links)
• Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
• Calculating the best dual bound for problems with multiple Lagrangian relaxations (Q2391512) (← links)
• The new robust conic GPLM method with an application to finance: prediction of credit default (Q2392775) (← links)
• On the approximability of adjustable robust convex optimization under uncertainty (Q2392812) (← links)
• Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
• A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints (Q2420789) (← links)
• Optimal robust insurance with a finite uncertainty set (Q2421397) (← links)
• A class of two-stage distributionally robust games (Q2423291) (← links)
• Robust multiobjective portfolio optimization: a set order relations approach (Q2424793) (← links)
• Confidence ellipsoids for static response of trusses with load and structural uncertainties (Q2459238) (← links)
• Genetic algorithm based technique for solving chance constrained problems (Q2464197) (← links)
• A two-stage fuzzy robust integer programming approach for capacity planning of environmental management systems (Q2480978) (← links)
• Tractable approximations to robust conic optimization problems (Q2492681) (← links)
• Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems (Q2492683) (← links)
• Generating a random collection of discrete joint probability distributions subject to partial information (Q2513651) (← links)
• Robust multiobjective optimization \& applications in portfolio optimization (Q2514713) (← links)
• Semidefinite programming for uncertain linear equations in static analysis of structures (Q2638116) (← links)
• Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
• A dynamic multi-period general routing problem arising in postal service and parcel delivery systems (Q2668612) (← links)
• An approach to the distributionally robust shortest path problem (Q2668652) (← links)
• Appointment scheduling with a quantile objective (Q2668736) (← links)
• Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
• Constrained Markov decision processes with uncertain costs (Q2670508) (← links)
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
• Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
• Robust convex optimization (Q2757566) (← links)
• A robust optimisation approach to the problem of supplier selection and allocation in outsourcing (Q2795193) (← links)
• Robustness to Time Discretization Errors in Water Network Optimization (Q2807011) (← links)
• Robust optimization in simulation: Taguchi and Krige combined (Q2815461) (← links)
• A discussion on the conservatism of robust linear optimization problems (Q2817238) (← links)
• Computationally tractable counterparts of distributionally robust constraints on risk measures (Q2832107) (← links)