Authors: M.V.Sarode
Abstract – In this paper we discuss the graphical and simplex method to maximize the profit of chair maker with his limited constraints( resources). Here we find the solution with both the method to solve a class of linear programming problem having all constraints ≤ type.
