Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2605.18669 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- This paper proposes a new robust optimization (RO) formulation namely the RO under objective functional uncertainty (ObRO). The ObRO adopts a min-max structure where the inner problem finds the worst-case objective function in a continuous function space to maximize the cost, and the outer problem finds the optimal decision in a Euclidean space to minimize the cost. A solution algorithm is designed to alternately generate the worst-case objective function at the current decision and the optimal decision for the current collection of objective functions. Using operator theory, we prove that this algorithm converges to the defined ``semi-global'' saddle point of the ObRO problem. In addition, we propose a numerical solver based on the piece-wise linearization (PWL) approximation of objective functions. The PWL approximate problem is proved to be numerically consistent with the original ObRO problem. The obtained results are applied to the degradation-aware battery charging scheduling in distribution networks.