A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints

\(\) We consider the bilevel knapsack problem with interdiction constraints, a fundamental bilevel integer programming problem which generalizes the 0-1 knapsack problem. In this problem, there are two knapsacks and \(n\) items. The objective is to select some items to pack into the first knapsack such that the maximum profit attainable from packing some of … Read more

Multi-Echelon Inventory Management for a Non-Stationary Capacitated Distribution Network

We present an inventory management solution for a non-stationary capacitated multi-echelon distribution network involving thousands of products. Assuming backlogged sales, we revisit and leverage the seminal multi-echelon inventory management results in the literature to establish the structural properties of the problem, and derive an efficient and practical solution method. In particular, we describe how the … Read more

Convergence of Trajectory Following Dynamic Programming algorithms for multistage stochastic problems without finite support assumptions

We introduce a class of algorithms, called Trajectory Following Dynamic Programming (TFDP) algorithms, that iteratively refines approximation of cost-to-go functions of multistage stochastic problems with independent random variables. This framework encompasses most variants of the Stochastic Dual Dynamic Programming algorithm. Leveraging a Lipschitz assumption on the expected cost-to-go functions, we provide a new convergence and … Read more

A Route-Based Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies

We consider a variant of the electric vehicle routing problem: a fleet of identical vehicles of limited capacity needs to visit a set of customers with given demands. An upper limit is imposed on the duration of the routes. Vehicles have limited autonomy: they may need to stop en-route at recharge stations. Recharges can be … Read more

Dynamic programming in convex stochastic optimization

This paper studies the dynamic programming principle for general convex stochastic optimization problems introduced by Rockafellar and Wets in the 1970s. We extend the applicability of the theory by relaxing compactness and boundedness assumptions. In the context of financial mathematics, the relaxed assumptions are satisfied under the well-known no-arbitrage condition and the reasonable asymptotic elasticity … Read more

Targeted Multiobjective Dijkstra Algorithm

In this paper, we introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for the One-to-One Multiobjective Shortest Path (MOSP) Problem. The T-MDA is based on the recently published Multiobjective Dijkstra Algorithm (MDA) and equips it with A*-like techniques. The resulting speedup is comparable to the speedup that the original A* algorithm achieves … Read more

Risk-Averse Stochastic Optimal Control: an efficiently computable statistical upper bound

In this paper, we discuss an application of the SDDP type algorithm to nested risk-averse formulations of Stochastic Optimal Control (SOC) problems. We propose a construction of a statistical upper bound for the optimal value of risk-averse SOC problems. This outlines an approach to a solution of a long standing problem in that area of … Read more

Solving Graph Partitioning on Sparse Graphs: Cuts, Projections, and Extended Formulations

This paper explores new solution approaches for the graph partitioning problem. While the classic formulations for graph partitioning are compact, they either suffer from a poor relaxation, symmetry, or contain a cubic number of constraints regardless of the graph density. These shortcomings often result in poor branch-and-bound performance. We approach this problem from perspective of … Read more

Dual SDDP for risk-averse multistage stochastic programs

Risk-averse multistage stochastic programs appear in multiple areas and are challenging to solve. Stochastic Dual Dynamic Programming (SDDP) is a well-known tool to address such problems under time-independence assumptions. We show how to derive a dual formulation for these problems and apply an SDDP algorithm, leading to converging and deterministic upper bounds for risk-averse problems. … Read more

Central Limit Theorem and Sample Complexity of Stationary Stochastic Programs

In this paper we discuss sample complexity of solving stationary stochastic programs by the Sample Average Approximation (SAA) method. We investigate this in the framework of Optimal Control (in discrete time) setting. In particular we derive a Central Limit Theorem type asymptotics for the optimal values of the SAA problems. The main conclusion is that … Read more