Please see the attached spreadsheet that goes along with the following problem:
One way to solve a linear program is to graph the inequalities to find the feasible region. Next, find the value of the objective function at each of the corner points (i.e., enumerating the corner points).© BrainMass Inc. brainmass.com October 10, 2019, 6:35 am ad1c9bdddf
Linear programming involves finding the maximum or minimum value of a linear function of two or more variables, known as the objective function, subject to a set of linear inequalities corresponding to these variables. One method of doing so is to first graph the region of R^n, where n is the number of ...
We solve a linear programming problem by evaluating the objective function at each vertex of the feasible region.