This question has been flagged
1 Reply
334 Views

?

Avatar
Discard


Finding the best solution that maximizes the objective function while meeting all the requirements is the main goal of the simplex technique in linear programming maximization issues. This entails iteratively increasing the value of the objective function by switching between workable and more optimal solutions up until the point at which no more improvements are conceivable. When the objective function reaches its highest value within the feasible zone delineated by the constraints, the solution is considered optimal.

Best Answer

It is an iterative process to get the feasible optimal solution. In this method, the value of the basic variable keeps transforming to obtain the maximum value for the objective function.

Avatar
Discard