In this paper, we develop new subgradient methods for solving nonsmooth convex optimization problems. These methods are the first ones, for which the whole sequence of test points is endowed with the worst-case performance guarantees. The new methods are derived from a relaxed estimating...

We consider the joint cost allocation problem that arises when several lots or resources are available to serve different products or divisions. We provide a two-phase model, wherein the first phase the optimal set of lots to be acquired is chosen and given the optimal set, and the products...