MINIMIZATION

OR
BIG M METHOD
(PROBLEM STEPS EXPLANATION)
UNIT II
OPERATIONS RESEARCH

- BY Z TUTORIALS
 Minimization problems
Big M method
 Objective function of z is of minimization type
 All the constraints are of greater than or equal to (≥ )type
 Surplus & artificial variables are used simultaneously both are added to objective
function and constraints
Surplus & artificial variables are added together to the objective function with surplus
variable coefficient being 0 and artificial variable coefficient being M (objective
function)
Surplus variables are subtracted and artificial variables are added into the constraints
together here (constraint function)
The surplus variable is denoted by ‘S’
And the artificial variable is denoted by ‘A’
 Compute Zj
Zj = ∑Cjxi
 Compute Cj-Zj
 See for the optimal solution
 Optimal solution is derived only when all Cj-Zj values are 0 or (+) ve
 If the optimal solution is not derived then you have to make simplex table II
 To prepare simplex table two we need
Key element:-when row and column get intersected on one cell then that cell
value is key element
Key row: - key row is derived by finding out minimum ratio. Key row is also
known as entering variable
𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛 𝑣𝑎𝑙𝑢𝑒
*Minimum ratio=
𝑐𝑜𝑟𝑟𝑒𝑠𝑝𝑜𝑛𝑑𝑖𝑛𝑔 𝑐𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡𝑠 𝑜𝑓 𝑘𝑒𝑦 𝑐𝑜𝑙𝑢𝑚𝑛
 Key column: - key column is derived by seeing the minimum value or most (-
)ve cj-zj value and its column will be the key column. Key column is also
called as leaving column as it leaves its self and places it in row column in
new simplex table.
 To make a new simplex table we need new values and to obtain new values
we need 2 formulae
𝑜𝑙𝑑 𝑘𝑒𝑦 𝑟𝑜𝑤 𝑣𝑎𝑙𝑢𝑒
*New key row value=
𝑘𝑒𝑦 𝑒𝑙𝑒𝑚𝑒𝑛𝑡
*New non key row value=
𝑐𝑜𝑟𝑟𝑒𝑠𝑝𝑜𝑛𝑑𝑖𝑛𝑔 𝑘𝑒𝑦 𝑐𝑙𝑜𝑢𝑚𝑛 𝑣𝑎𝑙𝑢𝑒∗𝑐𝑜𝑟𝑟𝑒𝑠𝑝𝑜𝑛𝑑𝑖𝑛𝑔 𝑟𝑜𝑤 𝑣𝑎𝑙𝑢𝑒
 Old row value -
𝑘𝑒𝑦 𝑒𝑙𝑒𝑚𝑒𝑛𝑡
 After deriving new key row values and new non key row values insert them
into the table and then see whether you are getting the optimal solution that
is whether all your cj-zj values are 0 or (+)ve
 If the optimal solution is derived then then write the x1 and x2 values and
substitute it in the objective function
 Note: - sometimes you may get the optimal solution in 2nd table or
sometimes the optimal solution will be obtained in 3rd table.

Calculations from scientific calculator is easy. But if you want to do it

manually you have to watch the next video
This video is only made to make you all understand the steps in
maximization problem
We will be doing problems in the next video
Till then stay tuned….

If you want this pdf or notes then you can ask me for notes on

ztutorials.zt@gmail.com