big M method
Sign in to savemethod of solving linear programming problems, extending the simplex algorithm to problems with greater-than constraints by associating the constraints with large negative constants
method of solving linear programming problems, extending the simplex algorithm to problems with greater-than constraints by associating the constraints with large negative constants