Question: You are given the following linear programming model in algebraic form, where x 1 and x 2 are the decision variables and Z is the
- You are given the following linear programming model in algebraic form, where x1 and x2 are the decision variables and Z is the value of the overall measure of performance.
MaximizeZ = 6 x1 + 4x2
subject to
Constraint on resource 1: 6x1 + 2x2 18 (amount available)
Constraint on resource 2: 2x1 + 4x2 16 (amount available)
- Identify the objective function, the functional constraints in this model.
- Is (x1, x2) = (4, 2) a feasible solution?
- Is (x1, x2) = (4, 6) a feasible solution?
- Is (x1, x2) = (0, 10) a feasible solution?
- Use Solver to solve this model.
Z = , x1 = , x2 = , s1 = , s2 =
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
