Graphical methods are used to solve Linear Programming Problems with two decision variables. This method involves plotting the constraints as straight lines on a graph and identifying the feasible region—the area that satisfies all constraints. The objective function is then evaluated at each corner (vertex) of this feasible region to determine the optimal solution, either for maximization or minimization. Although limited to two variables, this method provides a clear visual understanding of how constraints affect the solution space
#snsinstitutions
#snsdesignthinkers
#designthinking
