We study the existence and uniqueness of equilibria for perfectly competitive markets in capacitated transport networks. The model under consideration is rather general so that it captures basic aspects of related models in, e.g., gas or electricity networks. We formulate the market equilibrium model as a mixed complementarity problem and show the equivalence to a … Read more
In the analysis of complex stochastic dynamic programs, we often seek strong theoretical guarantees on the suboptimality of heuristic policies. One technique for obtaining performance bounds is perfect information analysis: this approach provides bounds on the performance of an optimal policy by considering a decision maker who has access to the outcomes of all future … Read more
This paper provides a first approach to assess gas market interaction on a network with nonconvex flow models. In the simplest possible setup that adequately reflects gas transport and market interaction, we elaborate on the relation of the solution of a simultaneous competitive gas market game, its corresponding mixed nonlinear complementarity problem (MNCP), and a … Read more
We propose and analyze two mathematical programming models for a production, inventory, distribution and routing problem considering real and relevant features from the furniture industry, such as production sequence-dependent setup times, heterogeneous fleet of vehicles, routes extending over one or more periods of the production planning horizon, multiple time windows and customers’ deadlines, among others. … Read more
The inmate assignment project, in close collaboration with the Pennsylvania Department of Corrections (PADoC), took five years from start to successful implementation. In this project, we developed the Inmate Assignment Decision Support System (IADSS), where the primary goal is simultaneous and system-wide optimal assignment of inmates to correctional institutions (CIs). We develop a novel hier- … Read more
The golf director problem introduced in Pavlikov et al. (2014) is a sports management problem that aims to find an allocation of golf players into fair teams for certain golf club competitions. The motivation for the problem is that club golf competitions are recreational events where the golf director wants to form teams that are … Read more
The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints. However, CSP has the typical structure that allows application of the renowned Benders’ decomposition method: once the “complicating” binary variables are … Read more
Resource allocation models in contingency planning aim to mitigate unexpected failures in supply chains due to disruptions with rare occurrence but disastrous consequences. This paper formulates this problems as a two-stage stochastic optimization with a risk-averse recourse function, and proposes a novel computationally tractable solution approach. The method relies on an inexact bundle method and … Read more
Mixed-Integer Second-Order Cone Programs (MISOCPs) form a nice class of mixed-inter convex programs, which can be solved very efficiently due to the recent advances in optimization solvers. Our paper bridges the gap between modeling a class of optimization problems and using MISOCP solvers. It is shown how various performance metrics of M/G/1 queues can be … Read more
Multi-stage stochastic optimization is a well-known quantitative tool for decision-making under uncertainty, which applications include financial and investment planning, inventory control, energy production and trading, electricity generation planning, supply chain management and similar fields. Theoretical solution of multi-stage stochastic programs can be found explicitly only in very exceptional cases due to the complexity of the … Read more