Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection

This paper considers the multi-item inventory lot-sizing problem with supplier selection. The problem consists in determining an optimal purchasing plan in order to satisfy dynamic deterministic demands for multiple items over a finite planning horizon, taking into account the fact that multiple suppliers are available to purchase from. As the complexity of the problem was an open question, we show that it is NP-hard. We propose a facility location extended formulation for the problem which can be preprocessed based on the cost structure and describe new valid inequalities in the original space of variables, which we denote (l,S_j)-inequalities. Furthermore, we study the projection of the extended formulation into the original space and show the connection between the inequalities generated by this projection and the newly proposed (l,S_j)-inequalities. Additionally, we present a simple and easy to implement yet very effective MIP (mixed integer programming) heuristic using the extended formulation. Computational results show that the preprocessed facility location extended formulation outperforms all other formulations for small and medium instances, as it can solve nearly all of them to optimality within the time limit. Moreover, the presented MIP heuristic is able to obtain solutions which strictly improve those achieved by a state-of-the art method for all the large benchmark instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2020

New approaches for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure

We consider the uncapacitated three-level lot-sizing and replenishment p...
research
06/20/2019

Service Network Design Problem with Capacity-Demand Balancing

This paper addresses developing cost-effective strategies to respond to ...
research
11/20/2018

Strong mixed-integer programming formulations for trained neural networks

We present an ideal mixed-integer programming (MIP) formulation for a re...
research
02/14/2018

Upgrading nodes in tree-shaped hub location

In this paper, we introduce the Tree of Hubs Location Problem with Upgra...
research
01/03/2020

A cutting-plane algorithm for the Steiner team orienteering problem

The Team Orienteering Problem (TOP) is an NP-hard routing problem in whi...
research
11/11/2021

Enhanced Formulation for Guillotine 2D Cutting Problems

We advance the state of the art in Mixed-Integer Linear Programming (MIL...
research
09/02/2022

On the arboreal jump number of a poset

A jump is a pair of consecutive elements in an extension of a poset whic...

Please sign up or login with your details

Forgot password? Click here to reset