Let's start with the definition. A linear programming problem is one of Optimizing (that is to say maximizing or minimizing) a linear function cx over the set of the solutions of a finite number of linear inequalities which may be expressed as either equalities or inequalities. With minor transformations any LP problem may be written in the form max of cx under the condition Ax 3/4 b for a suitable matrix A and rhs vector b.