Learn More
Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that primal and dual linear decision rule approximations can yield tractable upper and lower bounds on the optimal value of a stochastic program. Unfortunately,(More)
In recent years, decision rules have been established as the preferred solution method for addressing computationally demanding, multistage adaptive optimization problems. Despite their success, existing decision rules (a) are typically constrained by their a priori design and (b) do not incorporate in their modeling adaptive binary decisions. To address(More)
Decision rules provide a flexible toolbox for solving the computationally demanding, multistage adaptive optimization problems. There is a plethora of real-valued decision rules that are highly scalable and achieve good quality solutions. On the other hand, existing binary decision rule structures tend to produce good quality solutions at the expense of(More)
Linear stochastic programming provides a flexible toolbox for analyzing real-life decision situations, but it can become computationally cumbersome when recourse decisions are involved. The latter are usually modeled as decision rules, i.e., functions of the uncertain problem data. It has recently been argued that stochastic programs can quite generally be(More)
Robust control design for constrained uncertain systems is a well-studied topic. Given a known uncertainty set, the objective is to find a control policy that minimizes a given cost and satisfies the system's constraints for all possible uncertainty realizations. In this paper, we extend the classical robust control setup by treating the uncertainty sets as(More)
Decision-making under uncertainty has a long and distinguished history in operations research. However, most of the existing solution techniques suffer from the curse of dimensionality, which restricts their application to small and medium-sized problems, or they rely on simplifying modelling assumptions (e.g. absence of recourse actions). Recently, a new(More)
Model predicitve control problems for constrained hybrid systems are usually cast as mixed-integer optimization problems (MIP). However, commercial MIP solvers are designed to run on desktop computing platforms and are not suited for embedded applications which are typically restricted by limited computational power and memory. To alleviate these(More)