big M method
method of solving linear programming problems, extending the simplex algorithm to problems with greater-than constraints by associating the constraints with large negative constants
en-GB/ˈbɪɡ ɛm ˈmɛθəd/
en-US/ˈbɪɡ ˈɛm ˈmɛθəd/
method of solving linear programming problems, extending the simplex algorithm to problems with greater-than constraints by associating the constraints with large negative constants