We present a fully polynomial time approximation scheme (FPTAS) for minimizing an objective under linear constraints . Examples of such problems are combinatorial minimum weight product problems such as the following: given a graph and two edge weights find an - path that minimizes the product of its edge weights relative to and .