Question: Table 10-4 Minimize Z = P1 d1+ + P1 d1- + P1 d2+ + P1 d2- + P1 d3+ + P1 d3- Subject to: 4
Table 10-4
| Minimize | Z = P1 d1+ + P1 d1- + P1 d2+ + P1 d2- + P1 d3+ + P1 d3- |
| Subject to: | 4 X1 + 3 X2 + 5 X3 + d1- - d1+ = 240 |
24 X1 + 30 X2 + 32 X3 + d2- - d2+ = 1500 1 X1 + 2 X2 + X3 + d3- - d3+ = 50
| Optimal Solution Data: | ||||||
| Decision Variable | Solution Value | Goal | d+ | d- | Priority | Non-achievement |
| X1 | 12.5 | 1 | 0 | 2.5 | P1 | 2.5 |
| X2 | 0 | 2 | 0 | 0 | P1 | |
| X3 | 37.5 | 3 | 0 | 0 | P1 |
Table 10-4 represents a solution to a goal programming problem. There are three goals (each represented by a constraint). Goal number 3 represents a resource usage goal. How much of this resource would be used by this solution?
Group of answer choices
2500 units
240 units
50 units
70 units
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
