CBOT - Simplex & Big M method

In both Standard form and Canonical form of LPP the objective function must be

• Minimization

• Maximization

The constraints of Standard form of LPP must be reduced into

To convert  $\le$  constraints into equal to 

• Subtract Surplus Variables

• Add Slack Variables

To convert  $\ge$  constraints into equal to 

• Subtract Surplus Variables

• Add Slack Variables

If an initial basic feasible solution does not exist then add _______________ to the given standard form of LPP

• Slack Variable

• Artificial Variable

• Surplus Variable

The cost value of slack and surplus variables are

• 1

• 0

• M

• $-$ M

The cost value of an artificial variable in Maximization case is

• 1

• 0

• M

• $-$ M

The cost value of an artificial variable in Minimization case is

• 1

• 0

• M

• $-$ M

In maximization LPP, an optimum basic feasible solution exists only when all the net evaluations are

• $\le$ 0

• $\ge$ 0

Big M method also known as