Convex hull results for the warehouse problem

Limited Access
This item is unavailable until:
2020-11-01

Date

2018

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Discrete Optimization

Print ISSN

1572-5286

Electronic ISSN

Publisher

Elsevier B.V.

Volume

30

Issue

Pages

108 - 120

Language

English

Journal Title

Journal ISSN

Volume Title

Series

Abstract

Given an initial stock and a capacitated warehouse, the warehouse problem aims to decide when to sell and purchase to maximize profit. This problem is common in revenue management and energy storage. We extend this problem by incorporating fixed costs and provide convex hull descriptions as well as tight compact extended formulations for several variants. For this purpose, we first derive unit flow formulations based on characterizations of extreme points and then project out the additional variables using Fourier-Motzkin elimination. It turns out that the nontrivial inequalities are flow cover inequalities for some single node flow set relaxations.

Course

Other identifiers

Book Title

Citation