Scribd
Upload
371 views2 pages

Big - M Method (Simplex)

The Big M method is an extension of the simplex method that allows it to solve linear programming problems containing "greater-than" constraints. It works by introducing artificial variables associated with a large negative constant M, which would not be part of an optimal solution if one exists. The method converts all inequalities into less-than constraints that can be solved by the simplex algorithm, and introduces surplus and artificial variables to represent the greater-than constraints.

Uploaded by

MUSIC SAINI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
371 views2 pages

Big - M Method (Simplex)

The Big M method is an extension of the simplex method that allows it to solve linear programming problems containing "greater-than" constraints. It works by introducing artificial variables associated with a large negative constant M, which would not be part of an optimal solution if one exists. The method converts all inequalities into less-than constraints that can be solved by the simplex algorithm, and introduces surplus and artificial variables to represent the greater-than constraints.

Uploaded by

MUSIC SAINI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Big- M – Method (Charne's Penalty Method)

the Big M method is a method of solving linear


Programming problems using the Simplex method. The Big
M method extends the simplex algorithm to problems that
contain "greater-than" constraints. It does so by
associating the constraints with large negative constants
which would not be part of any optimal solution, if it exists.

Algorithm
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. This condition is
satisfied only when all the constraints (except non-
negativity) are less-than constraints and with a positive
constant on the right-hand side. The Big M method
introduces surplus and artificial variables to convert all
inequalities into that form. The "Big M" refers to a large
number associated with the artificial variables,
represented by the letter M.
The steps in the algorithm are as follows:
• Multiply the inequality constraints to ensure that the
right hand side is positive.
• If the problem is of minimization, transform to
maximization by multiplying the objective by −1
• For any greater-than constraints, introduce surplus and
artificial variables (as shown below)
• Choose a large positive Value M and introduce a term in
the objective of the form −M multiplying the artificial
variables
• For less-than or equal constraints, introduce slack
variables so that all constraints are equalities
• Solve the problem using the usual simplex method.

You might also like