Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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

inequalities such as $ax< b$;

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

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.

share|cite|improve this answer
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

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.