Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
From MaRDI portal
Publication:5057987
DOI10.1287/ijoc.2022.1163OpenAlexW4223467828MaRDI QIDQ5057987
Ahmadreza Marandi, Danique de Moor, Jianzhe Zhen, Dick den Hertog, Lieven Vandenberghe
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1163
reformulation-linearization techniquebilinear optimizationlinear decision rulesmixed integer convex optimization
Related Items
Optimization under uncertainty and risk: quadratic and copositive approaches, Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SCIP
- QCQP
- Multistage stochastic portfolio optimisation in deregulated electricity markets using linear decision rules
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Robust location transportation problems under uncertain demands
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On the power and limitations of affine policies in two-stage adaptive optimization
- Robust resource allocations in temporal networks
- On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
- Bilinear modeling solution approach for fixed charge network flow problems
- Enumeration of Nash equilibria for two-player games
- A perspective-based convex relaxation for switched-affine optimal control
- Duality in robust optimization: Primal worst equals dual best
- Multi-period portfolio optimization with linear control policies
- A note on the solution of bilinear programming problems by reduction to concave minimization
- A new reformulation-linearization technique for bilinear programming problems
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Adjustable robust solutions of uncertain linear programs
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Hybrid systems: computation and control. 5th international workshop, HSCC 2002, Stanford, CA, USA, March 25--27, 2002. Proceedings
- Perspective functions: properties, constructions, and examples
- The bilinear assignment problem: complexity and polynomially solvable special cases
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- The inverse optimal value problem
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- A relaxation method for nonconvex quadratically constrained quadratic programs
- On convex relaxations for quadratically constrained quadratic programming
- Convex programming for disjunctive convex optimization
- Robust counterparts of inequalities containing sums of maxima of linear functions
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- On mathematical programming with indicator constraints
- Variations and extension of the convex-concave procedure
- Two-person nonzero-sum games and quadratic programming
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Deriving robust counterparts of nonlinear uncertain inequalities
- Generalized Benders decomposition
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
- Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds
- Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
- Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets
- Robust Approximation to Multiperiod Inventory Management
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Optimality of Affine Policies in Multistage Robust Optimization
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- K-Adaptability in Two-Stage Robust Binary Programming
- An Affine Control Method for Optimal Dynamic Asset Allocation with Transaction Costs
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- The bilinear programming problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A cutting plane algorithm for solving bilinear programs
- Bilinear programming: An exact algorithm
- Optimal Facility Location with Concave Costs
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Adjustable Robust Optimization via Fourier–Motzkin Elimination
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- On the Optimality of Affine Policies for Budgeted Uncertainty Sets
- Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints
- Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management
- Convex Maximization via Adjustable Robust Optimization
- Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection
- Supermodularity and Affine Policies in Dynamic Robust Optimization
- Robust capacity expansion of network flows
- Equilibrium Points of Bimatrix Games
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
- Concavity cuts for disjoint bilinear programming
