Conclusion

The fundamental properties of solutions to linear programming problems have been established. The simplex method was presented for solving a linear program in which an objective function is sought to be maximized. It is an iterative method that involves examining the vertices of the constraint polyhedron to increase the objective function. The simplex method has been implemented in two different ways: firstly, using dictionaries, and secondly, with an array method consisting in updating the inverse of the basic constraint matrix. The latter method is implemented in a MATLAB code provided in the appendix (§ 10.2