(See Solution) Use Solver to solve the problem: Maximize: Z = 1x 1 + 1x 2 Subject to: 1x 1 + 2x 2 6 6x 1 + 4x 2 24 3x 1 +3x 2 21 x 1 , x 2 0 Can this problem
Question: Use Solver to solve the problem:
Maximize: Z = 1x 1 + 1x 2
Subject to: 1x 1 + 2x 2 6
6x 1 + 4x 2 24
3x 1 +3x 2 21
x 1 , x 2 0
- Can this problem be solved? If so, what is the optimal solution? If not, what is the problem?
- What would the solution be if the third constraint were removed from the problem?
Deliverable: Word Document 