Solve the following linear programming problem. Minimize subject to

Question

Solve the following linear programming problem. Minimize  subject to
​

Quizplus · Accepted Answer

Using the simplex algorithm, we can convert the problem into the following table:

|   |e   |b  |c  |s1 |s2  |RHS |
|---|---|---|---|---|----|----|
|s2 |0   |0  |0  |1  |1/5 |1260|
|e  |1   |0  |1/12|0  |1/12|273 |
|s1 |0   |1  |1/16|1/4|0    |630 |

The minimum value of the objective function is 273, which corresponds to the value in the RHS column of the e row. Therefore, the answer is C.

Solve the Following Linear Programming Problem