Building Load Control using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants

Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. However, the time-varying PV generation is not perfectly known when the system operator decides the HVAC control schedules. To consider the unknown uncertain PV generation, in this paper, we formulate a distributionally robust … Read more

Proximity in Concave Integer Quadratic Programming

A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of n∆ on the proximity of optimal solutions of an Integer Linear Programming problem and its standard linear relaxation. In this bound, n is the number of variables and ∆ denotes the maximum of the absolute values of the subdeterminants of the … Read more

A Restricted Dual Peaceman-Rachford Splitting Method for QAP

We revisit and strengthen splitting methods for solving doubly nonnegative, DNN, relaxations of the quadratic assignment problem, QAP. We use a modified restricted contractive splitting method, rPRSM, approach. Our strengthened bounds and new dual multiplier estimates improve on the bounds and convergence results in the literature. CitationDepartment of Combinatorics & Optimization, University of Waterloo, Canada,06/2019ArticleDownload … Read more

Refinements of Kusuoka Representations on L^{\infty}

We study Kusuoka representations of law invariant coherent risk measures on the space of bounded random variables. We refine this representation by giving that any law invariant coherent risk measure can be written as an integral of the Average Value-at-Risk measures on $[0,1]$, which gives a numerically constructive way to approximate any law invariant coherent … Read more

Decomposition-based algorithms for the crew scheduling and routing problem in road restoration

The crew scheduling and routing problem (CSRP) consists of determining the best route and schedule for a single crew to repair damaged nodes in a network affected by extreme events. The problem also involves the design of paths to connect a depot to demand nodes that become accessible only after the damaged nodes in these … Read more