Question

Using Simplex method, solve the following L.P.P.

Maximize 2x1 5x2 z   subject to the constraints

x1  4x2   24, 3x1  x2  21, x1  x2  9 ,

x1, x2  0 .
​

Answer 1

Subject to: 2x1 + 3x2 + x3 ≤. 5. 4x1 + x2 + 2x3 ≤ 11. 3x1 + 4x2 + 2x3 ≤. 8 x1,x2,x3 ≥ 0. (9.4) . The first step of the Simplex MethodSubject to: 2x1. +3x2. ≤ 6. (1). −3x1. +2x2. ≤ 3. (2). 2x2. ≤ 5. (3). 2x1. +x2. ≤ 4. (4) x1, x2. ≥ 0 . Goal: produce a pair of x1 and x2 that