Question: Homework:Homework 4-Linear Programming (ChMB) Question 5, Problem B.9 Brief Part 3 of 8 HW Score: 72.44%, 72.44 of 100 points Points: 0 of 8 Save
Homework:Homework 4-Linear Programming (ChMB)
Question 5, Problem B.9 Brief
Part 3 of 8
HW Score: 72.44%, 72.44 of 100 points
Points: 0 of 8
Save
Consider the following LP problem developed at Zafar Malik's Carbondale, Illinois, optical scanning firm:
| Maximize | Z= | 1X1+1X2 | ||
| Subject to: | 2X1+1X272 | (C1) | ||
| 1X1+2X272 | (C2) | |||
| X1,X20 |
The optimum solution is:
X1
=
24.00
(round your response to two decimal places).
X2
=24.00
(round your response to two decimal places).
Optimal solution value Z =
(round your response to two decimal places).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
