Question

Transform the following Linear Programming Problem into the standard form where all constraints are of equality type:

Maximize z= 2x1+x2-5x3+3x4

Subject to the constraints:

3x1+2x2 ≤ 15

4x1+5x2 ≥ 20

X1+x2-x3+2x4=10

2 ≤ 2x1+4x2-x3 ≤ 30

Xi ≥ 0; i=1 to 3 x4 unrestricted in sign.​

Answer 1

Answer:

uifddyzgjddysgttstrtuaesryidyosseyursosurooursroususot

Step-by-step explanation:

idysrysoustatulsflusiiailtiaiairalralira8prs5s57s4aa74lsi5s8srooauruatl