The objective of a linear programming problem is to obtain an optimal solution. Linear programming problems deal with the problem of minimizing or maximizing a linear objective function in the presence of a system of linear inequalities. The linear objective function represents cost or profit. A large and complex problem can be formulated in the form of a linear programming problem, and users can solve such a large problem in a definite amount of time using the simplex method and computer. This chapter presents a graphical method for solving linear programming problems. A linear programming problem is concerned with solving a very special type of problem—one in which all relations among the variables are linear both in the constraints and the function to be optimized. The chapter explains how to obtain the solution for linear programming problem using MATLAB.