you are given the following linear programming model in algebraic form, where X sub one and X sub two are the decision variables and Z is the value of the overall measure of performance. Maximize Z = 3x1 + 2x2 Subject to Constraint on resource 1: 3x1 + x2<5 (amount available) Constraint on resource 2: x1 + 2x2<8(amount available) and x1> 0 x2> 0 a. Identify the objective function, the functional constraints, and the non-negativity constraints in this model. b. Incorporate this model into a spreadsheet. c. Is (x1, x2) = (2, 1) a feasible solution? d. Is (x1, x2) = (2, 3) a feasible solution? e. Is (x1, x2) = (0, 5) a feasible solution? f. Use Solver to solve this model.
I need some help on these questions, I have no idea what to do. (Business Analytics)
Problem 1)
you are given the following linear programming model in algebraic form, where X sub one and X sub two are the decision variables and Z is the value of the overall measure of performance.
Maximize Z = 3x1 + 2x2
Subject to
Constraint on resource 1: 3x1 + x2<5 (amount available)
Constraint on resource 2: x1 + 2x2<8(amount available)
and
x1> 0 x2> 0
a. Identify the objective function, the functional constraints, and the non-negativity constraints in this model.
b. Incorporate this model into a spreadsheet.
c. Is (x1, x2) = (2, 1) a feasible solution?
d. Is (x1, x2) = (2, 3) a feasible solution?
e. Is (x1, x2) = (0, 5) a feasible solution?
f. Use Solver to solve this model.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
