Operations Research Notes-13

Unit-I

13 SPECIAL CASES : ALTERNATIVE SOLUTIONS, UNBOUNDED SOLUTIONS AND NON-EXISTING SOLUTIONS In this section, some important cases (except degeneracy) are discussed which are very often encountered during simplex procedure. The properties of these cases have already been visualised in the graphical solution of two variable LP problems. 13. Alternative Optimum Solutions Example 22. Use penalty (or Big-M) method to solve the problem : Max. z = 6x1 + 4x2, subject to 2x1 + 3x2 30, 3x1 + 2x2 24, x1+ x2 3 , and x1, x2 0. Is the solution unique ? If not, give two different solutions. Solution. Introducing the slack variables x3 0, x4 0, surplus variable x5 0, and artificial variable a1 0, the problem becomes: Max. z = 6x1 + 4x2 + 0x3 + 0x4 + 0x5 Ma1, subject to the constraints : 2x1 + 3x2 + x3 = 30 3x1 + 2x2 + x4 = 24 x1 + x2 - x5 + a1 =3 x1,x2, x3, x4, x5, a1 0 Now the solution is obtained as follows : Table 5 40

Reference: Operations Research (JNTU)(2007 Edition)

S.D.Sharma