Question: You are given the following data for a linear programming problem where the objective is to minimize the cost of conducting two nonnegative activities so
.png)
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model.
(c) Display the model on an Excel spreadsheet.
(d) Use the spreadsheet to check the following solutions: (x1, x2) = (7, 7), (7, 8), (8, 7), (8, 8), (8, 9), (9, 8). Which of these solutions are feasible? Which of these feasible solutions has the best value of the objective function?
(e) Use Solver to solve this model by the simplex method.
(f) Use ASPE and its Solver to solve the model by the simplex method.
Benefit Contribution per Unit of Each Activity Minimum Acceptable Level Benefit Activity 1 Activity 2 60 30 126 2 9 Unit cost $60 $50
Step by Step Solution
3.31 Rating (175 Votes )
There are 3 Steps involved in it
a Maximize C 60 x 1 50 x 2 Subject to 5x 1 3x 2 ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
545-M-S-L-P (304).docx
120 KBs Word File
