Introduce nonnegative slack variables and use the origin as the initial feasible simplex basis:In the simplex method, let enter. The ratio test is , so leaves. Solving the first constraint for yields the dictionaryAll nonbasic variables are nonnegative and have negative reduced objective coefficients. Setting them to zero is feasible and optimal:Subtracting from both right-hand sides changes the same dictionary toIt remains feasible throughout , including the degenerate endpoint , and the reduced coefficients are unchanged. HenceAs an independent optimality certificate, , with equality at the stated point. Negative reduced coefficients also prove uniqueness of the optimal decision vector.
Articles by others on the same topic
There are currently no matching articles.