This paper developed a MILP formulation to approximate a MNDP.
The major advantage of this linear programming formulation is that the global optimum solution to the MILP problem can be obtained, although multiple local optima may exist due to the non-convexity of the MNDP.