HAL (France)
open access
Exact approaches for convex adjustable robust optimization
Abstract Adjustable Robust Optimization (ARO) is a paradigm for facing uncertainty in a decision problem, in case some recourse actions are allowed after the actual value of all input parameters is revealed. While several approaches have been introduced for the linear case, little is known regarding
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimization Methods#3505
- Which Directions Matter? Sparse Design for Affine Robust Optimization#271828
- Lecture Notes on Applied Optimization#1085070
- Tannenbaum's gain-margin optimization meets Polyak's heavy-ball algorithm#986097
- Robust Constrained Optimization via Sliding Mode Control#304735
Record · ID 796341
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive