Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
From MaRDI portal
Publication:1616947
DOI10.1007/s10589-018-0015-1zbMath1409.90153OpenAlexW2808565663MaRDI QIDQ1616947
Publication date: 7 November 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-0015-1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polyhedral study of production ramping
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Optimal mapping of cloud virtual machines
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Primal and dual linear decision rules in stochastic and robust optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Positive definite completions of partial Hermitian matrices
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Decision making under uncertainty in electricity markets
- Polyhedral analysis and decompositions for capacitated plant location-type problems
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Semidefinite programming relaxations for semialgebraic problems
- Adjustable robust solutions of uncertain linear programs
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Convex and concave envelopes: revisited and new perspectives
- Multipolar robust optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- BARON: A general purpose global optimization software package
- Robust strategies for facility location under uncertainty
- Recent advances in robust optimization: an overview
- Large-scale unit commitment under uncertainty
- Solving security constrained optimal power flow problems by a structure exploiting interior point method
- Min-up/min-down polytopes
- Anneaux preordonnes
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Capacitated facility location problem with general setup cost
- Generalized Benders decomposition
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Robust Convex Optimization
- Chance-Constrained Programming
- Linear Programming under Uncertainty
- Multistage Adaptive Robust Optimization for the Unit Commitment Problem
- A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
- Optimal Energy Commitments with Storage and Intermittent Supply
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
- Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
- Distributionally Robust Convex Optimization
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Introduction to Stochastic Programming
- Distributionally Robust Optimization and Its Tractable Approximations
- Theory and Applications of Robust Optimization
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Computing in Operations Research Using Julia
- Solving Connected Subgraph Problems in Wildlife Conservation
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- The Price of Robustness
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Robust Solutions to Least-Squares Problems with Uncertain Data
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Chance Constrained Programming with Joint Constraints
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- Mixed-integer nonlinear optimization
- Convex Approximations of Chance Constrained Programs
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- On Polyhedral Approximations of the Second-Order Cone
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Capacitated facility location/network design problems.
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- Strong duality in lasserre's hierarchy for polynomial optimization
This page was built for publication: Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
