In a typical product-mix problem in linear programming, each general constraint states the function to minimize and maximize a subject in programming to a finite number. This was created by George Dantzig it was further improved using a new method to solving linear programming last 1984.
