We present an algorithm for solving the Weber problem when the set of feasible locations is the union of a finite number of convex polygons.

A major problem in foundries is to select scrap alloys and pure metals in order to produce at minimum cost alloy of specified composition. We show that such problems, of realistic size, can be solved optimally by mixed-integer programming. Constraints are that the content of the alloys in...