The point is nonnegative and makes all three inequalities equalities, with objective value . To certify global optimality, combine the first upper bound with coefficient , the second with coefficient one, and the lower bound with coefficient :
This is a weak duality certificate for the linear program. The feasible point attains the bound, so the optimal solution is and the maximum is . Equality forces each of the three constraints to be active; their simultaneous equations have this unique solution.

Articles by others on the same topic (0)

There are currently no matching articles.