This course is designed to teach linear programming methods and covers the following topics: the LP technique, the general formulation of an LP problem as an optimization problem, the graphical solution of two-dimensional LPs, which provides the foundation for the development of the Simplex method, basic concepts in LP theory, the Simplex algorithm for n-dimensional LPs and sensitivity analysis, the concept of duality and its economic interpretation, and transportation problems and their variants, such as the assignment problem and transshipment problem.