Polynomial time algorithms for minimax regret robust uncapacitated lot sizing models

We study the Minimax Regret Uncapacitated Lot Sizing (MRULS) model, where the production cost function and the demand are subject to uncertainty. We propose a polynomial time algorithm which solves the MRULS model in O(n6) time. We improve this running time to O(n5) when only the demand is uncertain, and to O(n4) when only the production cost function is uncertain.

MoreLess

Year of publication:	2013
Authors:	Li, Dai ; Romero-Morales, Dolores
Publisher:	University of Oxford

More details

Type of publication:	Other
Language:	English
Notes:	Li, Dai and Romero-Morales, Dolores (2013) Polynomial time algorithms for minimax regret robust uncapacitated lot sizing models. University of Oxford.
Source:	BASE

Persistent link: https://www.econbiz.de/10011426402