Question

2. Find all the basic feasible solutions of the following L. P. P without using the simplex algorithm: Maximize L = 2x1+3x2+ 4X3+ 7X4 subject to : 2x1+3x2 + x3 + 4x4 = 8 , X1,- 2X2 +6x3 - 7x4 = -3. i = 1, 2, 3,4. Xi >0​

Answer 1

Answer:

2. Find all the basic feasible solutions of the following L. P. P without using the simplex ... - did not match any documents.

Step-by-step explanation:

so sorry