Searcharxiv⌕ Search

arXiv subjects

Abdellah Bulaich Mehamdi

Publications and source records attributed to Abdellah Bulaich Mehamdi.

3 recordsLinked to original sources

Joint Design of Time-of-Use Schedules and Price Levels: a Bilevel Model with Client Participation and Load Flexibility

We study the joint design of a time-of-use (ToU) tariff (the partition of the day into pricing blocks and the price level attached to each block) by a profit-maximizing electricity retailer facing flexible clients who may refuse the offer in favour of an outside option. The problem is modeled as a bilevel program in which each client, at the lower level, reshapes its consumption under pointwise bounds and a fixed daily energy total, and simultaneously chooses a participation level penalized by a quadratic regularizer. We prove the client's best response is computable in loglinear time. We derive two equivalent single-level reformulations: a closed-form continuous one tackled via stochastic gradient ascent (using a continuous reparametrization of block start times and durations) and a mixed-integer nonlinear program solved via dedicated solvers. The stochastic ascent scheme provides Clarke-critical accumulation points almost surely, in a scalable way. On a case study from the French retail electricity market with $5000$ simulated households, the gradient method matches a commercial mixed-integer solver on the pointwise problem to within $0.3\%$ of the optimal profit while running two to eight times faster on $100$ representative clients. Restricting unconstrained pointwise prices to admissible ToU schedules yields an estimated profit loss of $1.3\%$- $13.8\%$ for two-period tariffs and $0.6\%$-$6.6\%$ for three-period tariffs on the instances considered.

math.OC↗

Duality between polyhedral approximation of value functions and optimal quantization of measures

Approximating a convex function by a polyhedral function that has a limited number of facets is a fundamental problem with applications in various fields, from mitigating the curse of dimensionality in optimal control to bi-level optimization. We establish a connection between this problem and the optimal quantization of a positive measure. Building on recent stability results in optimal transport, by Delalande and Mérigot, we deduce that the polyhedral approximation of a convex function is equivalent to the quantization of the Monge-Ampère measure of its Legendre-Fenchel dual. This duality motivates a simple greedy method for computing a parsimonious approximation of a polyhedral convex function, by clustering the vertices of a Newton polytope. We evaluate our algorithm on two applications: 1) A high-dimensional optimal control problem (quantum gate synthesis), leveraging McEneaney's max-plus-based curse-of-dimensionality attenuation method; 2) A bi-level optimization problem in electricity pricing. Numerical results demonstrate the efficiency of this approach.

math.OC↗

Pricing Filtering in Dantzig-Wolfe Decomposition

Column generation is used alongside Dantzig-Wolfe Decomposition, especially for linear programs having a decomposable pricing step requiring to solve numerous independent pricing subproblems. We propose a filtering method to detect which pricing subproblems may have improving columns, and only those subproblems are solved during pricing. This filtering is done by providing light, computable bounds using dual information from previous iterations of the column generation. The experiments show a significant impact on different combinatorial optimization problems.

cs.DM↗