A method for solving a discrete convex multiplicative programming (referred to as DCMP) is proposed. It is shown that DCMP can be solved by parametric discrete convex minimization. The method is specialized for the problem of minimizing the product of two discrete separable convex functions over a general supermatroid. The results of computational experiments for the last method are reported. An approximation algorithm is also proposed for solving the problem in a more general case.