Unit 4: Linear Progranmming = Duality A jou The necessacy and sulliciont condition for any LPP and its dual to have optimal solutions is tha both have feasible solutions 4.2 Dual Formulation The following, procedduee is adopted to convert primal problem into its dual, Simplex method is applied so obtain the optirnal solution for boll: primal and dial form Step [:Toreach constraint, n primal problem there isin associated variable in the dal problem Step 2:The elements of right-hand side of the constraints will be taky objective lunction in the dual problem asthe couitcients of th Step 3:11 the primal problem is maximization, then its dual problem will be minimization and Step 4: The inequualitio of the constraints should be interchanged tromt tos and view versa and the variables sn oth the problems ese non-negative Step 5: The rows of primal problem are changed to columns ia the dual problem, la other words the matrix «4 of the primal problem sill bo chan: «l to its teanspose (4 lor the dual problem, Step 6: The coeiticionts of the objective function will be taken to the Fight hand side of th constraints of dhe dita] problem, S| anuple 1: Write the dual of the following, problem. Subject to, Solition: The given problems is considered as primal lineae programming, problem. To convert it into dual, the following procedure is adopted. Step [: There are 2 constraints and hence the dal problem will have them as yan y variables, Let us denote Step 2: The right hand sidke-of the constraints ne char taken as thecootticients of the variables y andy, in the objective funetion Step 3: The primal objective problem is masimization andl henee the ual socks minimization for the objective tunetion. Hence, the objective functions for the dual peolblem is given by Minimise Z Step 4:The inequalities of the constraints for the primal problem ase of the type (2). Hence, the inoxualities for the dual constraints will be of the type G3 Step 5: The coefficient mateix for the primal problem is LOVELY PROFESSIONAL UNIVERSITY Notes