LinearProgramming finds a vector x that minimizes the quantity subject to the constraints and x≥0.
LinearProgramming finds a vector x that minimizes subject to x≥0 and linear constraints specified by the matrix m and the pairs . For each row of m, the corresponding constraint is if , or if , or if .
LinearProgramming finds approximate numerical results if its input contains approximate numbers. The option Tolerance specifies the tolerance to be used for internal comparisons. The default is Tolerance->Automatic, which does exact comparisons for exact numbers, and uses tolerance for approximate numbers.