# Strict inequalities in LP

How should we deal with strict inequalities in a linear programming problem? For example:

inequalities such as $ax< b$;

-
Add a tolerance, $\epsilon>0$ and try solving with $ax \leq b-\epsilon$. – copper.hat Jul 20 '12 at 7:57

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.
1. Linear programs are not necessarily about optimization, they can also be about feasibility. 2. Replacing ‘$\max$’ with ‘$\sup$’ evades the technical issue you point out. – equaeghe Jul 16 '13 at 14:30