We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multistage assembly problem. These inventory models ...

We devise an algorithm for solving the infinite-dimensional linear programs that arise from general deterministic semi-Markov decision processes on Borel spaces. The algorithm constructs a sequence of ...

Due to the NP -hardness of many machine learning problems such as clustering, decision tree, and neural network, one primary belief is that solving ML problems to global optimality is computationally ...