摘要
This paper examines the liner fleet deployment problem when only conditional shipping demand information is known. For such a case, it is generally not possible to determine the exact optimal solution. A set of complementary upper and lower bounds on the optimal cost are derived by exploiting the problem structure. These bounds are explicitly shown to converge to the optimal cost when a sufficiently refined partition is available. A numerical example illustrates the model.