ABSTRACT
Linear programming is a methodology for solving linear optimization problems, in which one wants to optimize a linear objective function subject to constraints on its variables expressed in terms of linear equalities and/or inequalities. Ever since the introduction of the simplex method by George Dantzig in the late 1940s, linear programming has played a major role in shaping the modern horizons of the field of optimization and its applications.
