In the Big-M Method (Linear Programming), how big should M Be?

Assume that you have the LP problem: Max z = c'x - M Sum[ y_i ]  subject to Ax + y = b, b > 0, x > 0, y>0. Assume that y is a vector of artificial variables. What is the smallest M to...

17 September 2014 2,921 11 View