What is the optimal condition for minimization problem in simplex method?
This question has been flagged
4
Replies
835
Views
The optimal condition for a minimization problem in the simplex method is when all the coefficients of the objective function's variables in the last row of the simplex tableau are non-negative or zero
Variable are non negative
the optimum is achieved when all z-row coefficients of non-basic variables are non-negative.
The optimal solution is reached when all the coefficients of the objective function's variables in the row corresponding to the objective function in the tableau are non-negative.
Enjoying the discussion? Don't just read, join in!
Create an account today to enjoy exclusive features and engage with our awesome community!
Sign up