Sun Baker's makes 2 kinds of special dessert every day.

A normal one
The chocolate flavoured dessert requires an additional input of 4g coc
The supplier of the cocoa powder has agreed to provide the powder o
is bought at a time. Due to the humid environment, storing up the coc
is not practical and so must be used up in a day. Both the items needs
the microwave oven which is available only for 5 hours a day
Infeasible solution

Maximize:
10X1+9X2

Subject to constraints
X1+X2< 5

4X1 > 24
X1,X2> 0

new constraints
X1+X2+X3 = 5
4X1-X4+a = 24
X1,X2> 0

Maximize
10X1+9X2+0X3+0X4-Ma
*M is a large number
Graphical Representation

0
-M

10
-M
 Simplex Table

10 9 0 0 -M
XB X1 X2 X3 X4 a RHS Ratio
X3 1 1 1 0 0 5 5
a 4 0 0 -1 1 24 6
Cj - Zj 10+4M 9 0 -M 0 -
X1 1 1 1 0 0 5
a 0 -4 -4 -1 1 4
Cj - Zj 0 -1-4M -10-4M -M 0

here the variable X1 and a are basic variables, so we don't consider them,
we
we look for X2, X3 and X4 and find that the Cj-Zj values corresponding to them
are negative Now we don’t have any entering variable
when we started the problem, we did it by introducing a variable 'a' to start the problem
we don’t want it to be as a part of final solution

we handled it by introducing a large variable 'M' with a negative sign so that the large negative
value of M will prevent it from being in the solution. We stated with the principle that
this a will not be a part of solution, (if solution exists) but later we find that we are not able
remove it from the solution. It shows that the original problem doesn’t have a solution at all

It creates the case of Infeasible solution