Please help me understand #2 A,b,c,d using the simplix method New row- (Current
ID: 3075102 • Letter: P
Question
Please help me understand #2 A,b,c,d using the simplix method New row- (Current row) (pivot column coefficient) X (New pivot rov Chapter 3 The Simplex Method and Sensitivity Analysis The steps of the simplex method are Step 1. Determine a starting basic feasible solution. Step2. Select an ensering variable using the optimality condition. Stop if there is no entering variable; the last solution is optimal Else, go to step 3 Step 3. Select a leaving variable using the feasibility condition Siep 4. Determine the new basic solution by using the appropriate Gauss-Jordan computations Go to step2 PROBLEM SET 3.38 L This problem is designed to reinforce your underseanding of the simplex feasibility condi- tion. In the first tableau in Example 33-1, we used the minimum (sonnegative) ratio test o determine the leaving variable Such a condition guarantees that sone of the new val- ues of the basic variables will become negative (as stipolated by the definition of the LP) To demoastrate this point, force sh, instead of s, to leave the basic solution Now, look at the resulting simplex tableau, and you will note that s assumes a negative value-12) meaning that the new solution is inleasible This stuation will never occur if we employ the mininum-ratio feasibility condition Consider the following set of constraints 2. 22 2t4 40 Solve the problem for each of the follewing okjoctive functions a) Maximize -2,+-3+5x )Maximize z-3-34x Minimian aSx-46- 3 Consider the following sysem of equations 3-23 Letand bea given initial basic leasible solution. Suppose that , becomes basic. Which of the given basic variables must become nonbasic at zero level to guarantee that all the variables remaia sonnegative, and what is te value of a,in the new solution Repeat this procedure for , ty, andExplanation / Answer
OR Deals with solving problems.
The objective function will be either to maximise or minimise a function.
In first step we convert it into standard form by converting it into the maximisation type and introducing slack and surplus variable according to the less than or greater than constraint respectively.
An initial basic solution is obtained by setting all the four variables to zero.
And then, atable is drawn with these slack variables in the table. Then we determine the difference between z value and the coefficients. And find the maximum negative.
Then the corresponding variable enters the table.
To find out th variable which leaves the basis, find he ratio and then the one with maximum ratio leaves the basis.