When are Lossy Energy Storage Optimization Models Convex?
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917841041620992 |
|---|---|
| author | Taha, Feras Al Bitar, Eilyan |
| author_facet | Taha, Feras Al Bitar, Eilyan |
| contents | We examine a class of optimization problems involving the optimal operation of a single lossy energy storage system, where energy losses occur during charging and discharging. These inefficiencies typically lead to a nonconvex set of feasible charging and discharging power profiles. In this paper, we derive an equivalent reformulation of this class of optimization problems by eliminating the charging and discharging power variables and recasting the problem entirely in terms of the storage state-of-charge variables. We show that the feasible set of the proposed reformulation is always convex. We also provide sufficient conditions under which the objective function of the proposed reformulation is guaranteed to be convex. The conditions provided both unify and generalize many existing conditions for convexity in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_14010 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | When are Lossy Energy Storage Optimization Models Convex? Taha, Feras Al Bitar, Eilyan Systems and Control Optimization and Control We examine a class of optimization problems involving the optimal operation of a single lossy energy storage system, where energy losses occur during charging and discharging. These inefficiencies typically lead to a nonconvex set of feasible charging and discharging power profiles. In this paper, we derive an equivalent reformulation of this class of optimization problems by eliminating the charging and discharging power variables and recasting the problem entirely in terms of the storage state-of-charge variables. We show that the feasible set of the proposed reformulation is always convex. We also provide sufficient conditions under which the objective function of the proposed reformulation is guaranteed to be convex. The conditions provided both unify and generalize many existing conditions for convexity in the literature. |
| title | When are Lossy Energy Storage Optimization Models Convex? |
| topic | Systems and Control Optimization and Control |
| url | https://arxiv.org/abs/2403.14010 |