Consider the following Linear Programming Problem: Max z5x1 +3x2 = Subject to: 4x12x212 4x1 x210 x1+x24...

 

Transcribed Image Text:

Consider the following Linear Programming Problem: Max z5x1 +3x2 = Subject to: 4x12x212 4x1 x210 x1+x24 x10, x2 0 i Solve this LP using the Simplex Method till we get a Basic Feasible Solu- tion (BFS) of this LP that will confirm that this LP is degenerate. Lets call this BFS a degenerate BFS ii Graph the feasible region of this LP to determine the constraints binding at the degenerate BFS found in part (ii). (Hint: Please don't forget that when we study BFS, we only consider the LP in the Standard Form) iii Are number of constraints binding at the degenerate BFS greater than m? Activat (m is the number of constraints of type Ax = b in the standard form of this LP) Go to Set Consider the following Linear Programming Problem: Max z5x1 +3x2 = Subject to: 4x12x212 4x1 x210 x1+x24 x10, x2 0 i Solve this LP using the Simplex Method till we get a Basic Feasible Solu- tion (BFS) of this LP that will confirm that this LP is degenerate. Lets call this BFS a degenerate BFS ii Graph the feasible region of this LP to determine the constraints binding at the degenerate BFS found in part (ii). (Hint: Please don't forget that when we study BFS, we only consider the LP in the Standard Form) iii Are number of constraints binding at the degenerate BFS greater than m? Activat (m is the number of constraints of type Ax = b in the standard form of this LP) Go to Set