Solve the following LPP with Simplex Method:
Maximize 2 - 2x + x + 4X
subject to constraints
- 2X, + 4% 54
x + 2x, 25
2x + 3x, 52
where XX and X is unrestricted.
Answers
Answered by
1
Answer:
Brainest
Explanation:
Consider the following linear program: ... Subject to: ... 4x + 3x =16 (c=16). 4. 2. 1 x axis. 2 x axis. 2. (3): 2x =5. 2. 1. (1): 2x + 3x =6. 2 ... Extreme points are at the intersection of constraints.
Similar questions