How should we deal with strict inequalities in a linear programming problem? For example:
inequalities such as $ax< b$;
In general strict inequalities are not treated in linear programming problems, since the solution is not guaranteed to exist on corner points.
Consider the $1$-variable LPP: $Max$ $x$ subject to $x<3$. Now there does not exist any value of $x$ for which maximum is achieved and which lies in the feasible region.