LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
From MaRDI portal
Publication:2164699
DOI10.1007/978-3-031-06901-7_17zbMath1497.90193arXiv2112.00868OpenAlexW4285023917MaRDI QIDQ2164699
Ayoub Foussoul, Omar El Housni, Vineet Goyal
Publication date: 16 August 2022
Full work available at URL: https://arxiv.org/abs/2112.00868
Cites Work
- Thresholded covering algorithms for robust and max-min optimization
- Relaxations and discretizations for the pooling problem
- On the power and limitations of affine policies in two-stage adaptive optimization
- Tractable stochastic analysis in high dimensions via robust optimization
- On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
- Bilinear modeling solution approach for fixed charge network flow problems
- A note on the solution of bilinear programming problems by reduction to concave minimization
- Different transformations for solving non-convex trim-loss problems by MINLP
- Adjustable robust solutions of uncertain linear programs
- The bilinear assignment problem: complexity and polynomially solvable special cases
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- On the power of static assignment policies for robust facility location problems
- A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
- Two-person nonzero-sum games and quadratic programming
- Generalized Benders decomposition
- Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds
- Theory and Applications of Robust Optimization
- Settling the complexity of computing two-player Nash equilibria
- The Price of Robustness
- The bilinear programming problem
- A cutting plane algorithm for solving bilinear programs
- Optimal Facility Location with Concave Costs
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- Adjustable Robust Optimization via Fourier–Motzkin Elimination
- On the Optimality of Affine Policies for Budgeted Uncertainty Sets
- Robust Combinatorial Optimization with Exponential Scenarios
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Matching Drivers to Riders: A Two-Stage Robust Approach
This page was built for publication: LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
