We consider two approximation formulations for the single product capacitated lot size problem. They correspond respectively to a restriction of the number of production policies and to the rounding of demands up to multiples ...

Many marketing models use variants of the relationship: market share equals marketing effort divided by total marketing effort. Usually, share is defined within a customer group presumed to be reasonably homogeneous and ...

We study four measures of problem instance behavior that might account for the observed differences in interior-point method (IPM) iterations when these methods are used to solve semidefinite programming (SDP) problem ...

We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalityconstrained minimal spanning tree problem and the identical customer vehicle routing problem. For each of these problems, ...

This paper considers a one-product, one-machine production/inventory probelm. Demand requests for the product are governed by a Poisson process with demand size being an exponential random variable. The production facility ...

Our concern lies in solving the following convex optimization problem: minimize cx subject to Ax=b, x \in P, where P is a closed convex set. We bound the complexity of computing an almost-optimal solution of this problem ...