The CheckLP class checks the solution to Linear Programming (LP) problems. Given a constraint matrix 'a', limit/RHS vector 'b' and cost vector 'c', determine if the values for the solution/decision vector 'x' minimizes the objective function 'f(x)', while satisfying all of the constraints, i.e.,
minimize f(x) = c x subject to a x <= b, x >= 0
Check the feasibility and optimality of the solution.
Value parameters
a
the M-by-N constraint matrix
b
the M-length limit/RHS vector (make b_i negative for ">=" constraint => surplus)