Optimization, Linear Programming, Convex Optimization, Duality, Towards Data Science.
leads to v=(-1, -3), which violates another dual feasibility condition v≥0. Similar process can be applied to the other 3 vertex points until we verify that [4/3, 8/3] satisfies all the KKT conditions, and claim it is the optimal solution. KKT Conditions for Linear Program with Equality Constraints