ﻻ يوجد ملخص باللغة العربية
To ensure a successful bid while maximizing of profits, generation companies (GENCOs) need a self-scheduling strategy that can cope with a variety of scenarios. So distributionally robust opti-mization (DRO) is a good choice because that it can provide an adjustable self-scheduling strategy for GENCOs in the uncertain environment, which can well balance robustness and economics compared to strategies derived from robust optimization (RO) and stochastic programming (SO). In this paper, a novel mo-ment-based DRO model with conditional value-at-risk (CVaR) is proposed to solve the self-scheduling problem under electricity price uncertainty. Such DRO models are usually translated into semi-definite programming (SDP) for solution, however, solving large-scale SDP needs a lot of computational time and resources. For this shortcoming, two effective approximate models are pro-posed: one approximate model based on vector splitting and an-other based on alternate direction multiplier method (ADMM), both can greatly reduce the calculation time and resources, and the second approximate model only needs the information of the current area in each step of the solution and thus information private is guaranteed. Simulations of three IEEE test systems are conducted to demonstrate the correctness and effectiveness of the proposed DRO model and two approximate models.
We consider optimization problems with uncertain constraints that need to be satisfied probabilistically. When data are available, a common method to obtain feasible solutions for such problems is to impose sampled constraints, following the so-calle
In this paper, we solve the multiple product price optimization problem under interval uncertainties of the price sensitivity parameters in the demand function. The objective of the price optimization problem is to maximize the overall revenue of the
We consider stochastic programs conditional on some covariate information, where the only knowledge of the possible relationship between the uncertain parameters and the covariates is reduced to a finite data sample of their joint distribution. By ex
We propose kernel distributionally robust optimization (Kernel DRO) using insights from the robust optimization theory and functional analysis. Our method uses reproducing kernel Hilbert spaces (RKHS) to construct a wide range of convex ambiguity set
This paper addresses the problem of utility maximization under uncertain parameters. In contrast with the classical approach, where the parameters of the model evolve freely within a given range, we constrain them via a penalty function. We show that