| Article ID: | iaor20119265 |
| Volume: | 39 |
| Issue: | 5 |
| Start Page Number: | 342 |
| End Page Number: | 345 |
| Publication Date: | Sep 2011 |
| Journal: | Operations Research Letters |
| Authors: | Zhang Muhong |
| Keywords: | programming: integer, programming: dynamic |
We consider two‐stage minimax robust uncapacitated lot‐sizing problem. A mixed integer programming formulation of the robust counterpart is proposed. We show that it is polynomial solvable under the interval uncertain demand set. A dynamic programming algorithm is developed.