Show the flaw by printing the error message.
Show the flaw by printing the error message.
the method where the error occurred
the error message
Check whether the solution is correct, feasible and optimal.
Check whether the solution is correct, feasible and optimal.
the N-length primal solution vector
the M-length dual solution vector
the optimum (maximum) value of the objective function
Is the solution dual feasible (y >= 0 and y a >= c)?
Is the solution dual feasible (y >= 0 and y a >= c)?
the M-length dual solution vector
Check whether the optimum objective function value f == c x == y b.
Check whether the optimum objective function value f == c x == y b.
the N-length primal solution vector
the M-length dual solution vector
the optimum (maximum) value of the objective function
Is the solution primal feasible (x >= 0 and a x [<= | >=] b)?
Is the solution primal feasible (x >= 0 and a x [<= | >=] b)?
the N-length primal solution vector
This 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' maximizes the objective function f(x), while satisfying all of the constraints, i.e.,
maximize f(x) = c x subject to a x <= b, x >= 0
Check the feasibility and optimality of the solution.