Use simplex method to solve
Maximize = 51 + 32
Subject to the constraints
1 + 2 ≤ 2
51 + 22 ≤ 10
31 + 82 ≤ 12
and 1, 2 ≥ 0
Answers
Answered by
6
Answer:
please support me yarr and mark as Brainliiests and please give some thanks in all my answers please
Step-by-step explanation:
Subject to Constraints: 3x + 2y ≤ 5. 2x + y – z ≤ 13. z ≤ 4. x,y,z≥0 ... an objective function, and; one or more constraints of the form a1x1 + a2x2 + … anxn le ... And use the 1 to eliminate the -12 in R3: 12R2+R3→R3.
Answered by
0
Answer:
false
false
false
true
Step-by-step explanation:
this is your answer false
Similar questions