A certain linear programming model involving two activities has the feasible region shown below.
The objective is to maximize the total profit from the two activities. The unit profit for activity 1 is $1,000 and the unit profit for activity 2 is $2,000.
Answer to relevant QuestionsFollow the instructions of Prob. 4.5-2 when the constraints are the following: and x1 ≥ 0, x2 ≥ 0, In problem (a) Demonstrate graphically that the feasible region is unbounded. Consider the following problem. Maximize Z = x1 + x2 + x3 +x4, Subject to and xj ≥ 0, for j = 1, 2, 3, 4. Follow the instructions of Prob. 4.6-5 for the following problem. Minimize Z = 5,000x1 + 7,000x2 Subject to and x1 ≥ 0, x2 ≥ 0. Consider the following problem. Maximize Z = –x1 + 2x2 +x3, Subject to (No nonnegativity constraints). (a) Reformulate this problem so that all variables have nonnegativity constraints. (b) Work through the simplex method ...Consider the following problem. Maximize Z = 2x1 – 2x2 + 3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Work through the simplex method step by step to solve the problem. (b) Identify the shadow prices for the three ...
Post your question