An official website of the United States government
Adjustable robust optimization (ARO) involves recourse decisions (i.e. reactive actions after the realization of the uncertainty, ‘wait-and-see’) as functions of the uncertainty, typically posed in a two-stage stochastic setting. Solving the general ARO problems is challenging, therefore ways to reduce the computational effort have been proposed, with the most popular being the affine decision rules, where ‘wait-and-see’ decisions are approximated as affine adjustments of the uncertainty. In this work we propose a novel method for the derivation of generalized affine decision rules for linear mixed-integer ARO problems through multi-parametric programming, that lead to the exact and global solution of the ARO problem. The problem is treated as a multi-level programming problem and it is then solved using a novel algorithm for the exact and global solution of multi-level mixed-integer linear programming problems. The main idea behind the proposed approach is to solve the lower optimization level of the ARO problem parametrically, by considering ‘here-and-now’ variables and uncertainties as parameters. This will result in a set of affine decision rules for the ‘wait-and-see’ variables as a function of ‘here-and-now’ variables and uncertainties for their entire feasible space. A set of illustrative numerical examples are provided to demonstrate the potential of the proposed novel approach.
more »
« less
Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
In this work, we consider two-stage quadratic optimization problems under ellipsoidal uncertainty. In the first stage, one needs to decide upon the values of a subset of optimization variables (control variables). In the second stage, the uncertainty is revealed, and the rest of the optimization variables (state variables) are set up as a solution to a known system of possibly nonlinear equations. This type of problem occurs, for instance, in optimization for dynamical systems, such as electric power systems as well as gas and water networks. We propose a convergent iterative algorithm to build a sequence of approximately robustly feasible solutions with an improving objective value. At each iteration, the algorithm optimizes over a subset of the feasible set and uses affine approximations of the second-stage equations while preserving the nonlinearity of other constraints. We implement our approach and demonstrate its performance on Matpower instances of AC optimal power flow. Although this paper focuses on quadratic problems, the approach is suitable for more general setups.
more »
« less
- Award ID(s):
- 2023140
- PAR ID:
- 10482174
- Publisher / Repository:
- Society for Industrial and Applied Mathematics
- Date Published:
- Journal Name:
- SIAM Journal on Optimization
- Volume:
- 33
- Issue:
- 4
- ISSN:
- 1052-6234
- Page Range / eLocation ID:
- 2830-2857
- Subject(s) / Keyword(s):
- nonconvex quadratic optimization two-stage robust optimization AC optimal power flow uncertainty in energy systems
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The non-linearity and non-convexity of the AC power flow equations may induce convergence problems to the Newton-Raphson (NR) algorithm. Indeed, as shown by Thorp and Naqavi, the NR algorithm may exhibit a fractal behavior. Furthermore, under heavy loading conditions or if some of the line reactances are relatively large compared to the others, the Jacobian matrix becomes ill-conditioned, which may cause the divergence of this algorithm. To address the aforementioned problems for radial power distribution systems, we propose in this paper to apply a sinusoidal transform to map the AC power flow equations into a convex quadratic form, which includes nodebased and Pythagorean equations. The good performance of the proposed approach is demonstrated via simulations carried out on several power distribution systems.more » « less
-
null (Ed.)We study the problem of maximizing energy transfer to a load in a DC microgrid while respecting constraints on bus voltages and currents, and accounting for the impact of neighboring constant power loads. Both the objective and dynamics give rise to indefinite quadratic terms, resulting in a non-convex optimization problem. Through change of variables and relaxations we develop a closely related second-order cone program. The problem retains the same feasible set as the original problem but utilizes a linear approximation of the non-convex objective. We demonstrate how this can be used to design approximately optimal charging profiles for periodic pulsed loads in real time.more » « less
-
We study the problem of maximizing energy transfer to a load in a DC microgrid while respecting constraints on bus voltages and currents, and accounting for the impact of neighboring constant power loads. Both the objective and dynamics give rise to indefinite quadratic terms, resulting in a non-convex optimization problem. Through change of variables and relaxations we develop a closely related second-order cone program. The problem retains the same feasible set as the original problem but utilizes a linear approximation of the non-convex objective. We demonstrate how this can be used to design approximately optimal charging profiles for periodic pulsed loads in real time.more » « less
-
Abstract Supervised machine learning techniques have proven to be effective tools for engineering design exploration and optimization applications, in which they are especially useful for mapping promising or feasible regions of the design space. The design space mappings can be used to inform early-stage design exploration, provide reliability assessments, and aid convergence in multiobjective or multilevel problems that require collaborative design teams. However, the accuracy of the mappings can vary based on problem factors such as the number of design variables, presence of discrete variables, multimodality of the underlying response function, and amount of training data available. Additionally, there are several useful machine learning algorithms available, and each has its own set of algorithmic hyperparameters that significantly affect accuracy and computational expense. This work elucidates the use of machine learning for engineering design exploration and optimization problems by investigating the performance of popular classification algorithms on a variety of example engineering optimization problems. The results are synthesized into a set of observations to provide engineers with intuition for applying these techniques to their own problems in the future, as well as recommendations based on problem type to aid engineers in algorithm selection and utilization.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1137/22M1469651
