Mixed-Integer Programming Techniques for the Connected Max-k-Cut Problem

We consider an extended version of the classical Max-k-Cut problem in which we additionally require that the parts of the graph partition are connected. For this problem we study two alternative mixed-integer linear formulations and review existing as well as develop new branch-and-cut techniques like cuts, branching rules, propagation, primal heuristics, and symmetry breaking. The … Read more

Adaptive Algorithmic Behavior for Solving Mixed Integer Programs Using Bandit Algorithms

State-of-the-art solvers for mixed integer programs (MIP) govern a variety of algorithmic components. Ideally, the solver adaptively learns to concentrate its computational budget on those components that perform well on a particular problem, especially if they are time consuming. We focus on three such algorithms, namely the classes of large neighborhood search and diving heuristics … Read more

Leveraging Predictive Analytics to Control and Coordinate Operations, Asset Loading and Maintenance

This paper aims to advance decision-making in power systems by proposing an integrated framework that combines sensor data analytics and optimization. Our modeling framework consists of two components: (1) a predictive analytics methodology that uses real-time sensor data to predict future degradation and remaining lifetime of generators as a function of the loading conditions, and … Read more

Multistage Stochastic Demand-side Management for Price-Making Major Consumers of Electricity in a Co-optimized Energy and Reserve Market

In this paper we take an optimization-driven heuristic approach, motivated by dynamic programming, to solve a multistage stochastic optimization of energy consumption for a large manufacturer who is a price-making major consumer of electricity. We introduce a mixed-integer program that co-optimizes consumption bids and interruptible load reserve offers, for such a major consumer over a … Read more

The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems

Randomization refers to the process of taking decisions randomly according to the outcome of an independent randomization device such as a dice or a coin flip. The concept is unconventional, and somehow counterintuitive, in the domain of mathematical programming, where deterministic decisions are usually sought even when the problem parameters are uncertain. However, it has … Read more

Scalable Algorithms for the Sparse Ridge Regression

Sparse regression and variable selection for large-scale data have been rapidly developed in the past decades. This work focuses on sparse ridge regression, which enforces the sparsity by use of the L0 norm. We first prove that the continuous relaxation of the mixed integer second order conic (MISOC) reformulation using perspective formulation is equivalent to … Read more

Strong formulations for conic quadratic optimization with indicator variables

We study the convex hull of the mixed-integer set given by a conic quadratic inequality and indicator variables. Conic quadratic terms are often used to encode uncertainties, while the indicator variables are used to model fixed costs or enforce sparsity in the solutions. We provide the convex hull description of the set under consideration when … Read more

Computing the Spark: Mixed-Integer Programming for the (Vector) Matroid Girth Problem

We investigate the NP-hard problem of computing the spark of a matrix (i.e., the smallest number of linearly dependent columns), a key parameter in compressed sensing and sparse signal recovery. To that end, we identify polynomially solvable special cases, gather upper and lower bounding procedures, and propose several exact (mixed-)integer programming models and linear programming … Read more

MIQP-Based Algorithm for the Global Solution of Economic Dispatch Problems with Valve-Point Effects

Even in a static setting, the economic load dispatch problem (ELDP)—namely the cost-optimal distribution of power among generating units to meet a specific demand subject to system constraints—turns out to be a challenge owing to the consideration of valve-point effects (VPE), which make the cost function nonsmooth and nonconvex. We present a new method, termed … Read more

Mathematical Programming Formulations for Piecewise Polynomial Functions

This paper studies mathematical programming formulations for solving optimization problems with piecewise polynomial (PWP) constraint functions. We elaborate on suitable polynomial bases as a means of efficiently representing PWPs in mathematical programs, comparing and drawing connections between the monomial basis, the Bernstein basis, and B-splines. The theory is presented for both continuous and semi-continuous PWPs. … Read more