More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polytope, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine (linear) function defined on this polytope. A linear programming algorithm finds a point in the polytope where this function has the largest (or smallest) value if such a point exists.
More formally linear programming is a technique for the optimization of a linear objective function subject to linear equality and linear inequality constraints Its feasible region is a convex polytope which is a set defined as the intersection of finitely many half spaces each of which is defined by a linear inequality Its objective function is a real-valued affine (linear) function defined on this polytope A linear programming algorithm finds a point in the polytope where this function has the largest (or smallest) value if such a point exists