Question

in Big-M method
which
variable we put equal to zero in objective function​

Answer 1

Answer:

here is your answer

Step-by-step explanation:

The simplex algorithm is the original and still one of the most widely used methods for solving linear maximization problems. However, to apply it, the origin (all variables equal to 0) must be a feasible point.

please mark as brain list