Source: wikibot/big-m-method

= Big M method
{wiki=Big_M_method}

The Big M method is a technique used in linear programming, particularly in the context of the Simplex algorithm, to handle problems involving artificial variables and constraints. It is useful when formulating linear programs that include constraints which cannot be easily satisfied by the original feasible region or that are not straightforward to convert into standard forms.