Solve Exercise 1 by enumerating all possible extreme point solutions and comparing them to determine the optimal solution.
Exercise 1
Solve the following linear program using the graphical method. Then write an alternate objective function for this model formulation such that the corner points (6, 5) and (4, 6) would be alternate optimal solutions.
Minimize Z = 3x1 + 2x2
Subject to: –3x1 + 4x2 ≤ 12
2x1 + 4x2 ≤ 32
x1 ≤ 6
x1, x2 ≥ 0
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.